Minimalism, justification and non-monotonicity in deductive databases

DOI10.1016/0022-0000(89)90004-4zbMath0676.68067OpenAlexW1985470198MaRDI QIDQ1123011

Richard Hull, Nicole Bidoit

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90004-4

zbMATH Keywords

minimalismdefault logicclosed world assumptionnon-monotonicityjustificationnegation as failuredeductive databasesCWANAF

Mathematics Subject Classification ID

Artificial intelligence (68T99) Mechanization of proofs and logical operations (03B35) Information storage and retrieval of data (68P20)

Related Items

Program equilibrium -- a program reasoning approach, General logical databases and programs: Default logic semantics and stratification, Negation in rule-based database languages: A survey, Negation by default and unstratifiable logic programs

Cites Work

• Saturation, nonmonotonic reasoning and the closed-world assumption
• Closed-world databases and circumscription
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Negation as failure. II
• Equality and Domain Closure in First-Order Databases
• Contributions to the Theory of Logic Programming
• A relational model of data for large shared data banks
• The Specialization of Programs by Theorem Proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item