Constraints in computational logics
The first-order theory of subtyping constraints
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Methodological View of Constraint Solving
Constraints
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
How to Make SQL Stand for String Query Language
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Language and Automata Theory and Applications
Anti-patterns for rule-based languages
Journal of Symbolic Computation
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The finite variant property: how to get rid of some algebraic properties
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Hi-index | 0.00 |