A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Formal Deductive Problem-Solving System
Journal of the ACM (JACM)
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
Completeness of Linear Refutation for Theories with Equality
Journal of the ACM (JACM)
A Unifying View of Some Linear Herbrand Procedures
Journal of the ACM (JACM)
A New Class of Automated Theorem-Proving Algorithms
Journal of the ACM (JACM)
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
A Human Oriented Logic for Automatic Theorem-Proving
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Another Generalization of Resolution
Journal of the ACM (JACM)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
State-space problem-reduction, and theorem proving—some relationships
Communications of the ACM
A theorem-proving language for experimentation
Communications of the ACM
Annals of Mathematics and Artificial Intelligence
Heuristic search vs. exhaustive search
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Predicting the length of solutions to problems
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Theorem proving with variable-constrained resolution
Information Sciences: an International Journal
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.04 |
A resolution in which one of the two parent clauses is a unit clause is called a unit resolution, whereas a resolution in which one of the two parent clauses is an original input clause is called an input resolution. A unit (input) proof is a deduction of the empty clause □ such that every resolution in the deduction is a unit (input) resolution. It is proved in the paper that a set S of clauses containing its unit factors has a unit proof if and only if S has an input proof. A LISP program implementing unit resolution is described and results of experiments are given.