Embedding circumscriptive theories in general disjunctive programs
From MaRDI portal
Publication:5101461
DOI10.1007/3-540-59487-6_25zbMath1496.68323OpenAlexW1545359038MaRDI QIDQ5101461
Publication date: 30 August 2022
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59487-6_25
Related Items (4)
Reasoning under minimal upper bounds in propositional logic ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ Implementing Prioritized Circumscription by Computing Disjunctive Stable Models ⋮ Prioritized logic programming and its application to commonsense reasoning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Closed-world databases and circumscription
- 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
- An efficient method for eliminating varying predicates from a circumscription
- Linear resolution for consequence finding
- A logic of knowledge and justified assumption
- Autoepistemic circumscription and logic programming
- Minimal belief and negation as failure
- Abductive Logic Programming
This page was built for publication: Embedding circumscriptive theories in general disjunctive programs