The computational value of joint consistency

DOI10.1007/BFB0021964MaRDI QIDQ4537429zbMATH OpenFDO

Authors Yannis Dimopoulos

Publication date 30 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0021964

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Toward efficient default reasoning
• Hard problems for simple default logics
• scientific article; zbMATH DE number 4166939
• On the computational complexity of assumption-based argumentation for default reasoning.
• Complexity of Default Logic on Generalized Conjunctive Queries

Cited in

(2)

• Default reasoning by deductive planning
• A new methodology for query answering in default logics via structure-oriented theorem proving

This page was built for publication: The computational value of joint consistency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537429)