Equational inference, canonical proofs, and proof orderings
Journal of the ACM (JACM)
Constraints in computational logics
A Methodological View of Constraint Solving
Constraints
Knuth-Bendix Constraint Solving Is NP-Complete
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
The Theory of Total Unary RPO Is Decidable
CL '00 Proceedings of the First International Conference on Computational Logic
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Orienting rewrite rules with the Knuth--Bendix order
Information and Computation - RTA 2001
Journal of Symbolic Computation - Special issue: First order theorem proving
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
Ordering-based strategies for horn clauses
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling
Journal of Automated Reasoning
Hi-index | 0.00 |