Embedding prioritized circumscription in disjunctive logic programs
From MaRDI portal
Publication:4421251
DOI10.1080/095281399146427zbMath1057.68575OpenAlexW1970731583MaRDI QIDQ4421251
Publication date: 2 November 2003
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/095281399146427
Cites Work
- Semantical considerations on nonmonotonic logic
- Closed-world databases and circumscription
- On the relationship between circumscription and negation as failure
- An algorithm to compute circumscription
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Minimal belief and negation as failure
- Autoepistemic logic
This page was built for publication: Embedding prioritized circumscription in disjunctive logic programs