A resolution framework for finitely-valued first-order logics
From MaRDI portal
Publication:1185455
DOI10.1016/S0747-7171(10)80002-1zbMath0751.68062MaRDI QIDQ1185455
Peter W. O'Hearn, Zbigniew Stachniak
Publication date: 28 June 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- The recursive resolution method for modal logic
- Completely non-clausal theorem proving
- Theory of logical calculi. Basic theory of consequence operations
- Complexity and related enhancements for automated theorem-proving programs
- On products of structures for generalized logics
- Special relations in automated deduction
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A resolution framework for finitely-valued first-order logics
