Back to search

Cornell University

PROOFS OF EQUALITY IN DEDUCTIVE DATABASE SYSTEMS

Abstract

dc:description.abstract

Deductive databases extend traditional databases by integrating logic-based inference rules, offering capabilities beyond simple data retrieval and enabling complex queries and data derivations. These systems are especially valuable for applications that require inferring new relationships and insights from existing data using logical rules. Equality is a fundamental concept in computer science, with critical applications in areas like formal verification, compiler optimization, and theorem proving. Integrating equality into deductive databases significantly extends their utility, enabling efficient and robust equational reasoning for more sophisticated data analysis and transformations. In this paper, I introduce a proof system P≡ for deductive databases extended with equality. This system offers a formal mechanism for reasoning about equivalences within the context of logic-based inference rules commonly used in deductivedatabases.

Degree

thesis:*
Name thesis:degree_name
M.S., Computer Science
Level thesis:degree_level
Master of Science
Discipline thesis:degree_discipline
Computer Science
Grantor
Cornell University
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Vu, Tia
Chair dc:contributor.chair
  • Foster, John
Committee member dc:contributor.committeemember
  • Murray, Sarah

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Bibid
16922050
Dc Identifier Other
ProQuest Submission ID: 12316
ProQuest Publication ID: 31641281

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Vu, Tia. PROOFS OF EQUALITY IN DEDUCTIVE DATABASE SYSTEMS. Master of Science thesis, Cornell University, 2024. https://hdl.handle.net/1813/117075