scientific article; zbMATH DE number 4164169

MaRDI QIDQ3490987zbMATH OpenFDO

Authors Andrew B. Baker, M. L. Ginsberg

Publication date 1989

zbMATH Keywords

computing parallel circumscriptiondefaultfirst-order theorem provingprioritized circumscriptiontheorem proving

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50)

Recommendations

• scientific article; zbMATH DE number 4106292
• A circumscriptive theorem prover
• scientific article; zbMATH DE number 2170948
• scientific article; zbMATH DE number 1090099
• scientific article; zbMATH DE number 1765677
• Embedding prioritized circumscription in disjunctive logic programs
• Logic Programming
• An Intuitionistic Predicate Logic Theorem Prover
• scientific article; zbMATH DE number 1696794

Cited in

(18)

• Evaluating dialectical structures
• Eliminating the fixed predicates from a circumscription
• A circumscriptive theorem prover
• How to reason defeasibly
• Prolog technology for default reasoning: proof theory and compilation techniques
• Lexicographic priorities in default logic
• An abstract, argumentation-theoretic approach to default reasoning
• ECWA made easy
• Modular specifications with supernormal defaults
• Bayesian ranking for strategy scheduling in automated theorem provers
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• scientific article; zbMATH DE number 4106292 (Why is no real title available?)
• scientific article; zbMATH DE number 1765677 (Why is no real title available?)
• scientific article; zbMATH DE number 1421069 (Why is no real title available?)
• Conservative query normalization on parallel circumscription
• Logic Programming
• When is argumentation deductive?
• Conditional entailment: bridging two approaches to default reasoning.

This page was built for publication:

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