| Publication | Date of Publication | Type |
|---|
| Knowledge problems in security protocols: going beyond subterm convergent theories | 2024-10-21 | Paper |
| Combined hierarchical matching: the regular case | 2024-05-27 | Paper |
Combining stable infiniteness and (strong) politeness
Journal of Automated Reasoning | 2023-10-24 | Paper |
| Politeness for the theory of algebraic datatypes | 2022-11-09 | Paper |
Polite combination of algebraic datatypes
Journal of Automated Reasoning | 2022-10-24 | Paper |
| Non-disjoint combined unification and closure by equational paramodulation | 2022-03-24 | Paper |
| Terminating non-disjoint combined unification | 2022-03-23 | Paper |
Politeness and stable infiniteness: stronger together
(available as arXiv preprint) | 2021-12-01 | Paper |
Computing knowledge in equational extensions of subterm convergent theories
Mathematical Structures in Computer Science | 2020-12-08 | Paper |
| Theory combination: beyond equality sharing | 2020-06-04 | Paper |
| Building and combining matching algorithms | 2020-06-04 | Paper |
Politeness and combination methods for theories with bridging functions
Journal of Automated Reasoning | 2020-03-03 | Paper |
Combination techniques for non-disjoint equational theories
Automated Deduction — CADE-12 | 2020-01-21 | Paper |
| Rule-based unification in combined theories and the finite variant property | 2019-12-04 | Paper |
Prototyping combination of unification algorithms with the \(\mathsf{ELAN}\) rule-based programming language
Rewriting Techniques and Applications | 2017-11-17 | Paper |
| Notions of knowledge in combinations of theories sharing constructors | 2017-09-22 | Paper |
A rewriting approach to the combination of data structures with bridging theories
Frontiers of Combining Systems | 2017-02-27 | Paper |
Unification and matching in hierarchical combinations of syntactic theories
Frontiers of Combining Systems | 2017-02-27 | Paper |
| Automatic decidability: a schematic calculus for theories with counting operators | 2017-02-01 | Paper |
A polite non-disjoint combination method: theories with bridging functions revisited
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
A gentle non-disjoint combination of satisfiability procedures
Automated Reasoning | 2014-09-26 | Paper |
On Asymmetric Unification and the Combination Problem in Disjoint Theories
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Hierarchical Combination
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
A rule-based framework for building superposition-based decision procedures
Rewriting Logic and Its Applications | 2012-10-16 | Paper |
Modular termination and combinability for superposition modulo counter arithmetic
Frontiers of Combining Systems | 2011-10-07 | Paper |
Combining satisfiability procedures for unions of theories with a shared counting operator
Fundamenta Informaticae | 2011-03-28 | Paper |
Matching in a class of combined non-disjoint theories.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Data structures with arithmetic constraints: A non-disjoint combination
Frontiers of Combining Systems | 2010-01-07 | Paper |
Combination of convex theories: modularity, deduction completeness, and explanation
Journal of Symbolic Computation | 2009-12-03 | Paper |
Combinable Extensions of Abelian Groups
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Combining Proof-Producing Decision Procedures
Frontiers of Combining Systems | 2008-09-16 | Paper |
Automatic Combinability of Rewriting-Based Satisfiability Procedures
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Theoretical Aspects of Computing – ICTAC 2005
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Frontiers of Combining Systems
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Theoretical Aspects of Computing - ICTAC 2004
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Manipulating algebraic specifications with term-based and graph-based representations
The Journal of Logic and Algebraic Programming | 2004-11-12 | Paper |
| scientific article; zbMATH DE number 2090074 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1956456 (Why is no real title available?) | 2003-07-30 | Paper |
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1722712 (Why is no real title available?) | 2002-03-21 | Paper |
| ASF+SDF parsing tools applied to ELAN | 2001-05-07 | Paper |
| Handling relations over finite domains in the rule-based system ELAN | 2001-05-07 | Paper |
| scientific article; zbMATH DE number 1140675 (Why is no real title available?) | 2000-10-08 | Paper |
| scientific article; zbMATH DE number 1414317 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1389653 (Why is no real title available?) | 2000-02-20 | Paper |
| scientific article; zbMATH DE number 1337859 (Why is no real title available?) | 1999-09-16 | Paper |
| scientific article; zbMATH DE number 1324441 (Why is no real title available?) | 1999-08-16 | Paper |
| scientific article; zbMATH DE number 1231673 (Why is no real title available?) | 1999-01-07 | Paper |
| scientific article; zbMATH DE number 1231665 (Why is no real title available?) | 1999-01-07 | Paper |
| scientific article; zbMATH DE number 1088023 (Why is no real title available?) | 1997-11-17 | Paper |
Combining decision algorithms for matching in the union of disjoint equational theories
Information and Computation | 1997-01-12 | Paper |
Combining symbolic constraint solvers on algebraic domains
Journal of Symbolic Computation | 1994-12-18 | Paper |
