A circumscriptive theorem prover
From MaRDI portal
Publication:1123640
DOI10.1016/0004-3702(89)90026-XzbMath0677.68096OpenAlexW2557892554MaRDI QIDQ1123640
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90026-x
Related Items
The complexity of propositional closed world reasoning and circumscription ⋮ A tableau prover for domain minimization ⋮ Tableau-based characterization and theorem proving for default logic ⋮ Modality and interrupts ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ ECWA made easy ⋮ Modular specifications with supernormal defaults ⋮ An SE-tree-based prime implicant generation algorithm ⋮ An extension of pointwise circumscription ⋮ Embedding circumscriptive theories in general disjunctive programs ⋮ Sound and efficient closed-world reasoning for planning ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Reducing belief revision to circumscription (and vice versa) ⋮ Compiling specificity into approaches to nonmonotonic reasoning ⋮ A sequent calculus for skeptical Default Logic ⋮ Sequent calculi for default and autoepistemic logics ⋮ A tableau calculus for minimal model reasoning ⋮ An efficient method for eliminating varying predicates from a circumscription ⋮ Linear resolution for consequence finding ⋮ On the complexity of propositional knowledge base revision, updates, and counterfactuals ⋮ How to reason defeasibly ⋮ Conservative query normalization on parallel circumscription ⋮ Embedding Logics in the Local Computation Framework ⋮ Compiling a default reasoning system into Prolog ⋮ Prolog technology for default reasoning: proof theory and compilation techniques ⋮ An abductive framework for negation in disjunctive logic programming ⋮ The open logic and its relation to circumscription
Cites Work
