Theorem proving for conditional logics: CondLean and GOALDUCK
From MaRDI portal
Publication:3643366
Recommendations
- CondLean: a theorem prover for conditional logics
- A sequent calculus and a theorem prover for standard conditional logics
- scientific article; zbMATH DE number 1696800
- Some Completeness Results for Propositional Conditional Logics
- Proof by consistency in conditional equational theories
- From input/output logics to conditional logics via sequents -- with provers
- On goal-directed provability in classical logic
- A family of goal directed theorem provers based on conjunction and implication. I
- Theorem proving for prenex Gödel logic with : checking validity and unsatisfiability
- Computer Science Logic
Cites work
- scientific article; zbMATH DE number 932649 (Why is no real title available?)
- A Gentzen- or Beth-type system, a practical decision procedure and a constructive completeness proof for the counterfactual logics VC and VCS
- A first-order conditional logic for prototypical properties
- A general approach for determining the validity of commonsense assertions using conditional logics
- A sequent- or tableau-style system for Lewis's counterfactual logic VC
- Automated reasoning with analytic tableaux and related methods. 16th international conference, TABLEAUX 2007, Aix en Provence, France, July 3--6, 2007. Proceedings.
- Basic conditional logic
- Conditional logic of actions and causation
- Conditional reasoning in logic programming
- Goal-directed proof theory
- Iterated belief revision and conditional logic
- Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
- Nonmonotonic reasoning, preferential models and cumulative logics
- Plausibility measures and default reasoning
- Tableaux for nonmonotonic logics
- Uniform proofs as a foundation for logic programming
- Updates and counterfactuals
- Weak AGM postulates and strong Ramsey test: A logical formalization
- lean TAP revisited
- lean\(T^ AP\): Lean tableau-based deduction
Cited in
(8)- KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
- Embedding and automating conditional logics in classical higher-order logic
- A general approach for determining the validity of commonsense assertions using conditional logics
- CondLean: a theorem prover for conditional logics
- A sequent calculus and a theorem prover for standard conditional logics
- Mechanising Gödel-Löb provability logic in HOL light
- CSL-\textsf{lean}: a theorem-prover for the logic of comparative concept similarity
- Automated Reasoning with Analytic Tableaux and Related Methods
This page was built for publication: Theorem proving for conditional logics: CondLean and GOALDUCK
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643366)
