Domain-independent formulas and databases
From MaRDI portal
Publication:1092679
DOI10.1016/0304-3975(87)90113-7zbMath0627.68077OpenAlexW1976814050MaRDI QIDQ1092679
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90113-7
logic programmingdeductive databasesdomain-independent databaseproof theoretic characterization of domain-independent formulas
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Translation of first order formulas into ground formulas via a completion theory ⋮ Domain-independent queries on databases with external functions ⋮ Unnamed Item ⋮ Safety, domain independence and translation of complex value database queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logic for improving integrity checking in relational data bases
- The decision problem for database dependencies
- Implementation of logical query languages for databases
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- A basis for deductive database systems
- Horn clause queries and generalizations
- Making prolog more expressive
- A basis for deductive database systems II
- Syntactical characterization of a subset of domain-independent formulas
- The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
This page was built for publication: Domain-independent formulas and databases