A resolution framework for finitely-valued first-order logics
Open Access
- 31 March 1992
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 13 (3) , 235-254
- https://doi.org/10.1016/s0747-7171(10)80002-1
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The resolution rule: An algebraic perspectivePublished by Springer Nature ,2005
- Multivalued logics: a uniform approach to reasoning in artificial intelligenceComputational Intelligence, 1988
- Linear modal deductionsPublished by Springer Nature ,1988
- The Recursive Resolution method for Modal LogicNew Generation Computing, 1987
- Special relations in automated deductionJournal of the ACM, 1986
- Modal theorem provingPublished by Springer Nature ,1986
- Completely non-clausal theorem provingArtificial Intelligence, 1982
- Complexity and related enhancements for automated theorem-proving programsComputers & Mathematics with Applications, 1976
- On products of structures for generalized logicsStudia Logica, 1969
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965