The complexity of predicate default logic over a countable domain
From MaRDI portal
Publication:1861328
DOI10.1016/S0168-0072(02)00064-7zbMath1016.03023MaRDI QIDQ1861328
Publication date: 16 March 2003
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
03B60: Other nonclassical logic
68T27: Logic in artificial intelligence
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability and definability with circumscription
- Closed-world databases and circumscription
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Non-monotonic logic. I
- A logic of knowledge and justified assumption
- A theory of nonmonotonic rule systems. II
- A theory of nonmonotonic rule systems I
- A comparative study of open default theories
- Extensions for open default theories via the domain closure assumption