Citation Impact
Citing Papers
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
1974
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
1980 Standout
Two Results on Ordering for Resolution with Merging and Linear Format
1971
Symbolic execution and program testing
1976 Standout
An Assessment of Techniques for Proving Program Correctness
1972
Unit Refutations and Horn Sets
1974
Artificial Intelligence: A New Synthesis
1998
A Proof Procedure Using Connection Graphs
1975
Ant Algorithms for Discrete Optimization
1999 Standout
Automated Negotiation: Prospects, Methods and Challenges
2001 Standout
A logic for default reasoning
1980 Standout
Linear-time algorithms for testing the satisfiability of propositional horn formulae
1984 Standout
Linear resolution with selection function
1971
Works of Daniel F. Carson being referenced
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
1965
The Concept of Demodulation in Theorem Proving
1967