leanTAP

swMATH9985MaRDI QIDQ21962FDOQ21962

Author name not available (Why is that?)

Described by source

• lean\(T^ AP\): Lean tableau-based deduction

Cited In (41)

• KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
• Analytic tableaux for all of \(\mathrm{SIXTEEN}_3\)
• α 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
• Title not available (Why is that?)
• Machine learning guidance for connection tableaux
• Free-variable tableaux for propositional modal logics
• Title not available (Why is that?)
• The disconnection tableau calculus
• Tableau reasoning for description logics and its extension to probabilities
• 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)
• Title not available (Why is that?)
• lean TAP revisited
• MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
• Logics in Artificial Intelligence
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Automated Reasoning with Analytic Tableaux and Related Methods
• A multi-engine theorem prover for a description logic of typicality
• Theorem proving for conditional logics: CondLean and GOALDUCK
• Encoding modal logics in logical frameworks
• Tableau methods for modal and temporal logics

This page was built for software: leanTAP