ECWA made easy

DOI10.1007/BF01530823zbMath0855.68028OpenAlexW2091610042MaRDI QIDQ1924727

Vladimir Lifschitz

Publication date: 14 January 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530823

zbMATH Keywords

extended closed world assumption

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties preserved under homomorphism
• Saturation, nonmonotonic reasoning and the closed-world assumption
• On the satisfiability of circumscription
• Closed-world databases and circumscription
• Negation as failure: careful closure procedure
• On the relationship between circumscription and negation as failure
• An algorithm to compute circumscription
• A circumscriptive theorem prover
• Circumscription - a form of non-monotonic reasoning
• On the relationship between CWA, minimal model, and minimal herbrand model semantics
• APPLICATIONS OF LYNDON HOMOMORPHISM THEOREMS TO THE THEORY OF MINIMAL MODELS

This page was built for publication: ECWA made easy