A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Theorem Proving via General Matings
Journal of the ACM (JACM)
A Theoretical Basis for the Systematic Proof Method
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A syntactic connection between proof procedures and refutation prcedures
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
Transforming Matings into Natural Deduction Proofs
Proceedings of the 5th Conference on Automated Deduction
Communications of the ACM
Inference with path resolution and semantic graphs
Journal of the ACM (JACM)
Theory links: Applications to automated theorem proving
Journal of Symbolic Computation
Theorem proving using equational matings and rigid E-unification
Journal of the ACM (JACM)
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
Dissolution: making paths vanish
Journal of the ACM (JACM)
Factorization and circuit in the connection method
Journal of the ACM (JACM)
Applications of feasible path analysis to program testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Test data generation and feasible path analysis
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
What You Always Wanted to Know about Rigid E-Unification
Journal of Automated Reasoning
A Local System for Classical Logic
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Adaptive Predicate Managers in Database Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A Matrix Characterization for MELL
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Ordered Resolution vs. Connection Graph Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
NP-Completeness of Refutability by Literal-Once Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Connections in nonclassical logics
Handbook of automated reasoning
First-order logic Davis-Putnam-Logemann-Loveland procedure
Exploring artificial intelligence in the new millennium
A Matrix Characterization for Multiplicative Exponential Linear Logic
Journal of Automated Reasoning
A note on resolution, connection graphs, and subsumption
ACM SIGART Bulletin
Compressing Propositional Refutations
Electronic Notes in Theoretical Computer Science (ENTCS)
A Bottom-Up Approach to Clausal Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Path resolution with link deletion
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Reducing the derivation of redundant clauses in reasoning systems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Strategies in rigid-variable methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Matrix proof methods for modal logics
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
Journal of Symbolic Computation
Path dissolution: a strongly complete rule of inference
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Path dissolution: a strongly complete rule of inference
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
What is the problem with proof nets for classical logic?
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$
Journal of Automated Reasoning
On the dynamic increase of multiplicities in matrix proof methods for classical higher-order logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Satisfiability checking of non-clausal formulas using general matings
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Automating Inductive Specification Proofs
Fundamenta Informaticae
| Hi-index | 0.02 |