An efficient method for eliminating varying predicates from a circumscription
From MaRDI portal
Publication:1193478
DOI10.1016/0004-3702(92)90051-XzbMath0762.03013WikidataQ59259770 ScholiaQ59259770MaRDI QIDQ1193478
Thomas Eiter, Georg Gottlob, Marco Cadoli
Publication date: 27 September 1992
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items
The complexity of propositional closed world reasoning and circumscription, Reducing belief revision to circumscription (and vice versa), Note about cardinality-based circumscription, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability and definability with circumscription
- Saturation, nonmonotonic reasoning and the closed-world assumption
- 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
- Eliminating the fixed predicates from a circumscription
- A circumscriptive theorem prover
- Circumscription - a form of non-monotonic reasoning
- Deduction in non-Horn databases