| Publication | Date of Publication | Type |
|---|
One-context unification with STG-compressed terms is in NP
| 2020-05-27 | Paper |
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
The HOM Problem is EXPTIME-Complete
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
The HOM problem is EXPTIME-complete
SIAM Journal on Computing | 2016-08-16 | Paper |
Unification and matching on compressed terms
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Emptiness and finiteness for tree automata with global reflexive disequality constraints
Journal of Automated Reasoning | 2015-06-23 | Paper |
Non-linear rewrite closure and weak normalization
Journal of Automated Reasoning | 2015-06-23 | Paper |
Automatic Evaluation of Reductions between NP-Complete Problems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The HOM problem is decidable
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Tree automata with height constraints between brothers
Lecture Notes in Computer Science | 2014-07-24 | Paper |
Automatic evaluation of context-free grammars (system description)
Lecture Notes in Computer Science | 2014-07-24 | Paper |
Closure of tree automata languages under innermost rewriting
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
Excessively duplicating patterns represent non-regular languages
Information Processing Letters | 2014-04-14 | Paper |
The HOM problem is decidable
| 2014-02-17 | Paper |
Decidable classes of tree automata mixing local and global constraints modulo flat theories
Logical Methods in Computer Science | 2013-06-20 | Paper |
Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete
SIAM Journal on Computing | 2011-07-29 | Paper |
Termination of rewriting with right-flat rules modulo permutative theories
Logical Methods in Computer Science | 2010-09-21 | Paper |
Normalization properties for shallow TRS and innermost rewriting
Applicable Algebra in Engineering, Communication and Computing | 2010-04-20 | Paper |
Context unification with one context variable
Journal of Symbolic Computation | 2009-12-03 | Paper |
Undecidable properties of flat term rewrite systems
Applicable Algebra in Engineering, Communication and Computing | 2009-10-19 | Paper |
Invariant Checking for Programs with Procedure Calls
Static Analysis | 2009-08-18 | Paper |
Unification with Singleton Tree Grammars
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Unique Normalization for Shallow TRS
Rewriting Techniques and Applications | 2009-06-30 | Paper |
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
Automated Deduction – CADE-21 | 2009-03-06 | Paper |
Recursive Path Orderings Can Also Be Incremental
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Classes of Tree Homomorphisms with Decidable Preservation of Regularity
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Termination of Rewriting with Right-Flat Rules
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Automated Reasoning
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Automated Deduction – CADE-20
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Constraint solving for term orderings compatible with abelian semigroups, monoids and groups
Constraints | 2005-03-15 | Paper |
Deciding confluence of certain term rewriting systems in polynomial time
Annals of Pure and Applied Logic | 2004-11-18 | Paper |
Characterizing confluence by rewrite closure and right ground term rewrite systems
Applicable Algebra in Engineering, Communication and Computing | 2004-10-28 | Paper |
Superposition with completely built-in abelian groups
Journal of Symbolic Computation | 2004-06-22 | Paper |
scientific article; zbMATH DE number 1962804 (Why is no real title available?)
| 2003-08-11 | Paper |
Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings
Journal of Automated Reasoning | 2003-06-09 | Paper |
scientific article; zbMATH DE number 1754647 (Why is no real title available?)
| 2002-06-12 | Paper |
scientific article; zbMATH DE number 1538015 (Why is no real title available?)
| 2000-12-03 | Paper |
