Implication of clauses is undecidable
Theoretical Computer Science
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
On the efficiency of subsumption algorithms
Journal of the ACM (JACM)
The resolution calculus
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
| Hi-index | 0.00 |