A rational reconstruction of nonmonotonic truth maintenance systems
From MaRDI portal
Publication:2638808
DOI10.1016/0004-3702(90)90086-FzbMath0717.68081OpenAlexW136379439MaRDI QIDQ2638808
Publication date: 1990
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(90)90086-f
autoepistemic logiclogic programmingNP- complete problemdependency-directed backtrackingnonmonotonic truth maintenance systemsstable set semantics
Related Items (21)
A decision method for nonmonotonic reasoning based on autoepistemic reasoning ⋮ LARS: a logic-based framework for analytic reasoning over streams ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Default reasoning using classical logic ⋮ Propositional truth maintenance systems: Classification and complexity analysis ⋮ Consistency-based and abductive diagnoses as generalised stable models ⋮ Propositional semantics for disjunctive logic programs ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ On the impact of stratification on the complexity of nonmonotonic reasoning ⋮ Ticker: A system for incremental ASP-based stream reasoning ⋮ An incremental algorithm for generating all minimal models ⋮ A general framework for reason maintenance ⋮ Contributions to the stable model semantics of logic programs with negation ⋮ Truth maintenance systems and their application for verifying expert system knowledge bases ⋮ The alternating fixpoint of logic programs with negation ⋮ Unnamed Item ⋮ Thirteen Definitions of a Stable Model ⋮ Stable models and difference logic ⋮ Non monotonic reasoning and belief revision: syntactic, semantic, foundational and coherence approaches ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Extending and implementing the stable model semantics
Cites Work
- Semantical considerations on nonmonotonic logic
- On the relation between default and autoepistemic logic
- A logic for default reasoning
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- On the Complexity of Timetable and Multicommodity Flow Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A rational reconstruction of nonmonotonic truth maintenance systems