On the complexity of extension checking in default logic

DOI10.1016/j.ipl.2005.12.005zbMath1187.68584OpenAlexW2042523249MaRDI QIDQ844157

Paolo Liberatore

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.005

zbMATH Keywords

computational complexityknowledge representationdefault logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Redundancy in logic. III: Non-monotonic reasoning

Cites Work

• A logic for default reasoning
• Operational concepts of nonmonotonic logics. I: Default logic
• Alternative approaches to default logic
• Propositional default logics made easier: computational complexity of model checking.
• Unnamed Item
• Unnamed Item