lean\(T^ AP\): Lean tableau-based deduction
From MaRDI portal
Publication:1904400
DOI10.1007/BF00881804zbMath0838.68097MaRDI QIDQ1904400
Bernhard Beckert, Joachim Posegga
Publication date: 28 May 1996
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
68T27: Logic in artificial intelligence
Related Items
α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic, leanTAP, The disconnection tableau calculus, IeanCOP: lean connection-based theorem proving, Implementing a relational theorem prover for modal logic, Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic, Theorem proving for conditional logics: CondLean and GOALDUCK
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Seventy-five problems for testing automatic theorem provers
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- SETHEO: A high-performance theorem prover
- Toward Mechanical Mathematics
- A Mechanical Proof Procedure and its Realization in an Electronic Computer