A circumscriptive theorem prover
From MaRDI portal
Publication:1123640
DOI10.1016/0004-3702(89)90026-XzbMath0677.68096MaRDI QIDQ1123640
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items
Embedding Logics in the Local Computation Framework, Compiling a default reasoning system into Prolog, Reasoning under minimal upper bounds in propositional logic, 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, Prolog technology for default reasoning: proof theory and compilation techniques, The open logic and its relation to circumscription, The complexity of propositional closed world reasoning and circumscription, A tableau prover for domain minimization, Tableau-based characterization and theorem proving for default logic, 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, Modality and interrupts, ECWA made easy, Modular specifications with supernormal defaults, An SE-tree-based prime implicant generation algorithm
Cites Work
