A circumscriptive theorem prover
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 4106291 (Why is no real title available?)
- scientific article; zbMATH DE number 3731310 (Why is no real title available?)
- Circumscription - a form of non-monotonic reasoning
- GIB: Imperfect information in a computationally challenging game
- Nonmonotonic logic and temporal projection
- Ordering conjunctive queries
Cited in
(33)- Compiling a default reasoning system into Prolog
- Reducing belief revision to circumscription (and vice versa)
- A tableau calculus for minimal model reasoning
- scientific article; zbMATH DE number 4106292 (Why is no real title available?)
- Sound and efficient closed-world reasoning for planning
- Compiling specificity into approaches to nonmonotonic reasoning
- scientific article; zbMATH DE number 4164169 (Why is no real title available?)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- An SE-tree-based prime implicant generation algorithm
- Embedding Logics in the Local Computation Framework
- Embedding circumscriptive theories in general disjunctive programs
- 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
- ECWA made easy
- Modular specifications with supernormal defaults
- Sequent calculi for default and autoepistemic logics
- An abductive framework for negation in disjunctive logic programming
- 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
- scientific article; zbMATH DE number 1765677 (Why is no real title available?)
- 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)
