The semantics of incomplete databases as an expression of preferences
From MaRDI portal
Publication:753482
DOI10.1016/0304-3975(51)90005-9zbMATH Open0716.68029OpenAlexW2052188443MaRDI QIDQ753482FDOQ753482
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- Title not available (Why is that?)
- An algorithm to compute circumscription
- A logic for default reasoning
- Saturation, nonmonotonic reasoning and the closed-world assumption
- On the relationship between circumscription and negation as failure
- Circumscription - a form of non-monotonic reasoning
- Title not available (Why is that?)
- On the declarative and procedural semantics of logic programs
- A fixpoint semantics for disjunctive logic programs
- Title not available (Why is that?)
- The Alexander Method - a technique for the processing of recursive axioms in deductive databases
- Closed-world databases and circumscription
- Title not available (Why is that?)
- An efficient strategy for non-Horn deductive databases
Cited In (1)
This page was built for publication: The semantics of incomplete databases as an expression of preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753482)
