The semantics of incomplete databases as an expression of preferences
From MaRDI portal
(Redirected from Publication:753482)
Recommendations
Cites work
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4092826 (Why is no real title available?)
- scientific article; zbMATH DE number 4104920 (Why is no real title available?)
- scientific article; zbMATH DE number 4104921 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- A fixpoint semantics for disjunctive logic programs
- A logic for default reasoning
- An algorithm to compute circumscription
- An efficient strategy for non-Horn deductive databases
- Circumscription - a form of non-monotonic reasoning
- Closed-world databases and circumscription
- On the declarative and procedural semantics of logic programs
- On the relationship between circumscription and negation as failure
- Saturation, nonmonotonic reasoning and the closed-world assumption
- The Alexander Method - a technique for the processing of recursive axioms in deductive databases
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753482)