A circumscriptive theorem prover

DOI10.1016/0004-3702(89)90026-XzbMATH Open0677.68096OpenAlexW2557892554MaRDI QIDQ1123640FDOQ1123640

Authors: M. L. Ginsberg 

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

Recommendations

• scientific article; zbMATH DE number 4106292
• scientific article; zbMATH DE number 4164169
• scientific article; zbMATH DE number 1765677
• A theorem prover for a computational logic
• Publication:3490989
• scientific article; zbMATH DE number 2000437
• An Intuitionistic Predicate Logic Theorem Prover
• scientific article; zbMATH DE number 1223614

zbMATH Keywords

default reasoningcircumscriptive theories

Mathematics Subject Classification ID

Artificial intelligence (68T99) Mechanization of proofs and logical operations (03B35)

Cites Work

• GIB: Imperfect information in a computationally challenging game
• Circumscription - a form of non-monotonic reasoning
• Title not available (Why is that?)
• Nonmonotonic logic and temporal projection
• Title not available (Why is that?)
• Ordering conjunctive queries

Cited In (33)

• A tableau calculus for minimal model reasoning
• Title not available (Why is that?)
• Compiling a default reasoning system into Prolog
• Reducing belief revision to circumscription (and vice versa)
• Sound and efficient closed-world reasoning for planning
• Compiling specificity into approaches to nonmonotonic reasoning
• Title not available (Why is that?)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Embedding Logics in the Local Computation Framework
• Embedding circumscriptive theories in general disjunctive programs
• An SE-tree-based prime implicant generation algorithm
• Modality and interrupts
• Linear resolution for consequence finding
• An abstract, argumentation-theoretic approach to default reasoning
• The open logic and its relation to circumscription
• Reasoning under minimal upper bounds in propositional logic
• Circumscription with homomorphisms
• \(\mathsf{XRay}\): a Prolog technology theorem prover for default reasoning: a system description
• An extension of pointwise circumscription
• A sequent calculus for skeptical Default Logic
• An abductive framework for negation in disjunctive logic programming
• Sequent calculi for default and autoepistemic logics
• ECWA made easy
• Modular specifications with supernormal defaults
• An Evaluation Based Theorem Prover
• Prolog technology for default reasoning: proof theory and compilation techniques
• An efficient method for eliminating varying predicates from a circumscription
• How to reason defeasibly
• A tableau prover for domain minimization
• Title not available (Why is that?)
• Tableau-based characterization and theorem proving for default logic
• The complexity of propositional closed world reasoning and circumscription
• Conservative query normalization on parallel circumscription

This page was built for publication: A circumscriptive theorem prover

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