Constraints in computational logics
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
Constraint Logic Programming with Hereditary Harrop formulas
Theory and Practice of Logic Programming
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic
Journal of Automated Reasoning
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
ACM Transactions on Computational Logic (TOCL)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
The Ground Tree Transducer Game
Fundamenta Informaticae
Simple and Minimal Ground Term Equation Systems
Fundamenta Informaticae
| Hi-index | 5.23 |