Complexity results for 2CNF default theories

MaRDI QIDQ2729669zbMATH OpenFDO

Authors Xishun Zhao, Decheng Ding

Publication date 23 July 2001

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

complexity of default reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Recommendations

• Complexity results for restricted credulous default reasoning
• scientific article; zbMATH DE number 408811
• scientific article; zbMATH DE number 52991
• The Complexity of Reasoning for Fragments of Default Logic
• scientific article; zbMATH DE number 4166939

Cited in

(4)

• 2-cnfs and logical embeddings
• Fixed-parameter tractability of disjunction-free default reasoning
• Redundancy in logic. II: 2CNF and Horn propositional formulae
• Complexity results for restricted credulous default reasoning

This page was built for publication: Complexity results for 2CNF default theories

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