Default reasoning using classical logic

DOI10.1016/0004-3702(95)00095-XMaRDI QIDQ2171265zbMATH OpenFDO

Authors Rachel Ben-Eliyahu, Rina Dechter

Publication date 23 September 2022

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(95)00095-X

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• Yet some more complexity results for default logic
• The Complexity of Reasoning for Fragments of Default Logic
• Complexity of Default Logic on Generalized Conjunctive Queries
• Tableau-based characterization and theorem proving for default logic
• scientific article; zbMATH DE number 140378

Cites work

• A logic for default reasoning
• A note on linear resolution strategies in consequence-finding
• A rational reconstruction of nonmonotonic truth maintenance systems
• A sufficient condition for backtrack-bounded search
• A theory of diagnosis from first principles
• Complexity Results for Nonmonotonic Logics
• Depth-First Search and Linear Graph Algorithms
• Formalizing nonmonotonic reasoning systems
• Hard problems for simple default logics
• scientific article; zbMATH DE number 4158606 (Why is no real title available?)
• scientific article; zbMATH DE number 4056963 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 4128783 (Why is no real title available?)
• Network-based heuristics for constraint-satisfaction problems
• On the relation between default and autoepistemic logic
• Propositional semantics for disjunctive logic programs
• Semantical considerations on nonmonotonic logic
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Tree clustering for constraint networks

Cited in

(13)

• Argumentation in artificial intelligence
• Encoding deductive argumentation in quantified Boolean formulae
• Reasoning with minimal models: efficient algorithms and applications
• Extending and implementing the stable model semantics
• Yet some more complexity results for default logic
• Coherence in finite argument systems.
• Propositional default logics made easier: computational complexity of model checking.
• Preprocessing of intractable problems
• Graph-based construction of minimal models
• scientific article; zbMATH DE number 2014711 (Why is no real title available?)
• scientific article; zbMATH DE number 1759386 (Why is no real title available?)
• Default logic and bounded treewidth
• A new default theories compilation for MSP-entailment

This page was built for publication: Default reasoning using classical logic

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