Increasing the efficiency of automated theorem proving
From MaRDI portal
Publication:4835513
DOI10.1080/11663081.1995.10510841zbMath0827.68100OpenAlexW2103879019MaRDI QIDQ4835513
M. Ojeda, G. Aguilera, Inma P. de Guzmán
Publication date: 13 December 1995
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/11663081.1995.10510841
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A first polynomial non-clausal class in many-valued logic ⋮ Temporal reasoning over linear discrete time
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Seventy-five problems for testing automatic theorem provers
- On finding common subtrees
- Automated Theorem Proving: After 25 Years
- Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
This page was built for publication: Increasing the efficiency of automated theorem proving
