leanTAP
From MaRDI portal
LeanTAP
Cited in
(78)- Tableau methods for modal and temporal logics
- Analytic tableaux for all of \(\mathrm{SIXTEEN}_3\)
- KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
- α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic
- Experimental analysis of some computation rules in a simple parallel reasoning system for the \(\mathcal{ALC}\) description logic
- SOLAR: a consequence finding system for advanced reasoning
- Implementing a relational theorem prover for modal logic K
- \(\mathsf{ileanTAP}\): an intuitionistic theorem prover
- Implementing and evaluating provers for first-order modal logics
- scientific article; zbMATH DE number 1341480 (Why is no real title available?)
- scientific article; zbMATH DE number 1301971 (Why is no real title available?)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
- Machine learning guidance for connection tableaux
- scientific article; zbMATH DE number 1612565 (Why is no real title available?)
- The disconnection tableau calculus
- scientific article; zbMATH DE number 1341618 (Why is no real title available?)
- Free-variable tableaux for propositional modal logics
- Tableau reasoning for description logics and its extension to probabilities
- PAG
- SETHEO
- lolliCoP
- GrAnDe
- SATCHMO
- E-SETHEO
- LoTREC
- ileanCoP
- DLog
- aleanTAP
- CondLean
- CSLLean
- KLMLean
- NESCOND
- Prefuse
- linTAP
- KtSeqC
- ModLeanTAP
- PreDeLo
- TWB
- KANREN
- miniKanren
- 3TAP
- MleanCoP
- nanoCoP
- SWI-Prolog
- PR-OWL
- VINTE
- HARP
- METEOR
- Binder
- THOT
- KL-ONE
- PRIZ
- OntoDLV
- DysToPic
- Slakje
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- Free variable tableaux for propositional modal logics
- The Tableau Workbench
- IeanCOP: lean connection-based theorem proving
- HYPNO: Theorem Proving with Hypersequent Calculi for Non-normal Modal Logics (System Description)
- scientific article; zbMATH DE number 1301855 (Why is no real title available?)
- lean TAP revisited
- MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
- Logics in Artificial Intelligence
- scientific article; zbMATH DE number 1341478 (Why is no real title available?)
- Logic programming as a basis for lean automated deduction
- LeanT A P: Lean tableau-based theorem proving
- Asynchronous knowledge with hidden actions in the situation calculus
- scientific article; zbMATH DE number 1252517 (Why is no real title available?)
- scientific article; zbMATH DE number 2090123 (Why is no real title available?)
- VINTE: an implementation of internal calculi for Lewis' logics of counterfactual reasoning
- CSL-\textsf{lean}: a theorem-prover for the logic of comparative concept similarity
- Prolog Technology Reinforcement Learning Prover
- nanoCoP: a non-clausal connection prover
- Theorem proving for conditional logics: CondLean and GOALDUCK
- Automated Reasoning with Analytic Tableaux and Related Methods
- A multi-engine theorem prover for a description logic of typicality
- Encoding modal logics in logical frameworks
This page was built for software: leanTAP
