Encompassment Properties and Automata with Constraints

Constraint solving on terms

Constraints in computational logics

The undecidability of the first-order theories of one step rewriting in linear canonical systems

Information and Computation

Observational proofs by rewriting

Theoretical Computer Science

Recognizable tree-languages and non-linear morphisms

Theoretical Computer Science

Directional Type Checking for Logic Programs: Beyond Discriminative Types

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems

The Recognizability Problem for Tree Automata with Comparisons between Brothers

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99

Predicate Logic and Tree Automata with Tests

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000

The Theory of Total Unary RPO Is Decidable

CL '00 Proceedings of the First International Conference on Computational Logic

Ground reducibility is EXPTIME-complete

Information and Computation

Computing constructor forms with non terminating rewrite programs

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications

Bottom-up tree automata with term constraints

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning

Twenty years later

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Multiple congruence relations, first-order theories on terms, and the frames of the applied pi-calculus

TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications

Narrowing, abstraction and constraints for proving properties of reduction relations

Rewriting Computation and Proof

Regular Tree Languages And Rewrite Systems

Fundamenta Informaticae