The semantics of incomplete databases as an expression of preferences

DOI10.1016/0304-3975(51)90005-9zbMath0716.68029OpenAlexW2052188443MaRDI QIDQ753482

Véronique Royer

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(51)90005-9

zbMATH Keywords

operational semanticsincomplete informationdeductive databasesdeclarative semantics

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient strategy for non-Horn deductive databases
• Saturation, nonmonotonic reasoning and the closed-world assumption
• Closed-world databases and circumscription
• On the relationship between circumscription and negation as failure
• An algorithm to compute circumscription
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• The Alexander Method - a technique for the processing of recursive axioms in deductive databases
• On the declarative and procedural semantics of logic programs
• A fixpoint semantics for disjunctive logic programs
• The Semantics of Predicate Logic as a Programming Language

This page was built for publication: The semantics of incomplete databases as an expression of preferences