Default reasoning using classical logic

DOI10.1016/0004-3702(95)00095-XzbMath1506.68131MaRDI QIDQ2171265

Rina Dechter, Rachel Ben-Eliyahu

Publication date: 23 September 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (8)

Reasoning with minimal models: efficient algorithms and applications ⋮ Argumentation in artificial intelligence ⋮ Encoding deductive argumentation in quantified Boolean formulae ⋮ Graph-based construction of minimal models ⋮ Coherence in finite argument systems. ⋮ Preprocessing of intractable problems ⋮ Extending and implementing the stable model semantics ⋮ Yet some more complexity results for default logic

Cites Work

• Semantical considerations on nonmonotonic logic
• Formalizing nonmonotonic reasoning systems
• A theory of diagnosis from first principles
• Network-based heuristics for constraint-satisfaction problems
• On the relation between default and autoepistemic logic
• Tree clustering for constraint networks
• A logic for default reasoning
• Hard problems for simple default logics
• Propositional semantics for disjunctive logic programs
• A note on linear resolution strategies in consequence-finding
• A rational reconstruction of nonmonotonic truth maintenance systems
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A sufficient condition for backtrack-bounded search
• Complexity Results for Nonmonotonic Logics
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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