Constraints and theorem proving
Constraints in computational logics
A General Setting for Flexibly Combining and Augmenting Decision Procedures
Journal of Automated Reasoning
A Rewrite Rule Based Framework for Combining Decision Procedures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Normalization via Rewrite Closures
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science
Term rewriting restricted to ground terms
Theoretical Computer Science
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Note: on ground tree transformations and congruences induced by tree automata
Theoretical Computer Science
Journal of Automated Reasoning
Fast congruence closure and extensions
Information and Computation
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Type checking with open type functions
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Combination of convex theories: Modularity, deduction completeness, and explanation
Journal of Symbolic Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Canonized rewriting and ground AC completion modulo shostak theories
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Knuth-Bendix completion as a data structure
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Outsidein(x) modular type inference with local assumptions
Journal of Functional Programming - Dedicated to ICFP 2009
Proof-producing congruence closure
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Join algorithms for the theory of uninterpreted functions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Constructing rewrite-based decision procedures for embeddings and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
A pearl on SAT and SMT solving in Prolog
Theoretical Computer Science
Simple and Minimal Ground Term Equation Systems
Fundamenta Informaticae
Theory propagation and rational-trees
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Hi-index | 0.00 |