Accelerating tableaux proofs using compact representations
From MaRDI portal
Publication:1334905
DOI10.1007/BF01384237zbMath0808.03006MaRDI QIDQ1334905
Thomas Kropf, Klaus Schneider, Ramayya Kumar
Publication date: 26 September 1994
Published in: Formal Methods in System Design (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Proof methods for modal and intuitionistic logics
- Seventy-five problems for testing automatic theorem provers
- About the Paterson-Wegman linear unification algorithm
- First-order modal tableaux
- Linear unification
- Structuring and automating hardware proofs in a higher-order theorem- proving environment
- Untersuchungen über das logische Schliessen. I
- Matings in matrices
- Theorem Proving via General Matings
- An Efficient Unification Algorithm
- A Proof Procedure Using Connection Graphs
- A Machine-Oriented Logic Based on the Resolution Principle
- On Extensions of Elementary Logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Accelerating tableaux proofs using compact representations
