A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms. - Hélène Kirchner; Christophe Ringeissen (JICSLP, 1992)

Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras. - Christophe Ringeissen (LPAR, 1992)

Combinaison de résolutions de contraintes. (Combination of constraint solvers). - Christophe Ringeissen (1993)

Combination Techniques for Non-Disjoint Equational Theories. - Eric Domenjoud; Francis Klay; Christophe Ringeissen (CADE, 1994)

Constraint Solving by Narrowing in Combined Algebraic Domains. - Hélène Kirchner; Christophe Ringeissen (ICLP, 1994)

Combination of Matching Algorithms. - Christophe Ringeissen (STACS, 1994)

Combining Symbolic Constraint Solvers on Algebraic Domains. - Hélène Kirchner; Christophe Ringeissen (J. Symb. Comput., 1994)

Cooperation of Decision Procedures for the Satisfiability Problem. - Christophe Ringeissen (FroCoS, 1996)

Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories. - Christophe Ringeissen (Inf. Comput., 1996)

Higher-Order Equational Unification via Explicit Substitutions. - Claude Kirchner; Christophe Ringeissen (ALP/HOA, 1997)

Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language. - Christophe Ringeissen (RTA, 1997)

SoleX: A Domain-Independent Scheme for Constraint Solver Extension. - Éric Monfroy; Christophe Ringeissen (AISC, 1998)

Handling ELAN rewrite programs via an exchange format. - Peter Borovanský; Salma Jamoussi; Pierre-Etienne Moreau; Christophe Ringeissen (WRLA, 1998)

An overview of ELAN. - Peter Borovanský; Claude Kirchner; Hélène Kirchner; Pierre-Etienne Moreau; Christophe Ringeissen (WRLA, 1998)

Rule-Based Constraint Programming. - Claude Kirchner; Christophe Ringeissen (Fundam. Informaticae, 1998)

Generating Propagation Rules for Finite Domains: A Mixed Approach. - Christophe Ringeissen; Éric Monfroy (New Trends in Constraints, 1999)

An Open Automated Framework for Constraint Solver Extension: the SoleX Approach. - Éric Monfroy; Christophe Ringeissen (Fundam. Informaticae, 1999)

ASF+SDF parsing tools applied to ELAN. - Mark van den Brand; Christophe Ringeissen (WRLA, 2000)

Handling Relations over Finite Domains in the Rule-Based System ELAN. - Christophe Ringeissen (WRLA, 2000)

Matching with Free Function Symbols - A Simple Extension of Matching? - Christophe Ringeissen (RTA, 2001)

Pattern-Matching Compiler. - Pierre-Etienne Moreau; Christophe Ringeissen; Marian Vittek (LDTA@ETAPS, 2001)

Rewriting with Strategies in ELAN: A Functional Semantics. - Peter Borovanský; Claude Kirchner; Hélène Kirchner; Christophe Ringeissen (Int. J. Found. Comput. Sci., 2001)

Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae. - David Déharbe; Anamaria Martins Moreira; Christophe Ringeissen (RTA, 2002)

The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration. - Mark van den Brand; Pierre-Etienne Moreau; Christophe Ringeissen (LDTA@ETAPS, 2002)

Matching in a Class of Combined Non-disjoint Theories. - Christophe Ringeissen (CADE, 2003)

A Pattern Matching Compiler for Multiple Target Languages. - Pierre-Etienne Moreau; Christophe Ringeissen; Marian Vittek (CC, 2003)

A Rule Language for Interaction. - Carlos Castro 001; Éric Monfroy; Christophe Ringeissen (CSCLP, 2003)

A Tool Support for Reusing ELAN Rule-Based Components. - Anamaria Martins Moreira; Christophe Ringeissen; Anderson Santana (RULE@RDP, 2003)

Unions of non-disjoint theories and combinations of satisfiability procedures. - Cesare Tinelli; Christophe Ringeissen (Theor. Comput. Sci., 2003)

Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn. - Silvio Ranise; Christophe Ringeissen; Duc-Khanh Tran (ICTAC, 2004)

Preface. - Slim Abdennadher; Christophe Ringeissen (RULE@RDP, 2004)

Manipulating algebraic specifications with term-based and graph-based representations. - Anamaria Martins Moreira; Christophe Ringeissen; David Déharbe; Gleydson Lima (J. Log. Algebraic Methods Program., 2004)

Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic. - Silvio Ranise; Christophe Ringeissen; Calogero G. Zarba (FroCoS, 2005)

On Superposition-Based Satisfiability Procedures and Their Combination. - Hélène Kirchner; Silvio Ranise; Christophe Ringeissen; Duc-Khanh Tran (ICTAC, 2005)

Decision Procedures for the Formal Analysis of Software. - David Déharbe; Pascal Fontaine; Silvio Ranise; Christophe Ringeissen (ICTAC, 2006)

Automatic Combinability of Rewriting-Based Satisfiability Procedures. - Hélène Kirchner; Silvio Ranise; Christophe Ringeissen; Duc-Khanh Tran (LPAR, 2006)

Special issue on combining logical systems. - Alessandro Armando; Christophe Ringeissen (Inf. Comput., 2006)

Combining Proof-Producing Decision Procedures. - Silvio Ranise; Christophe Ringeissen; Duc-Khanh Tran (FroCoS, 2007)

Timed Specification For Web Services Compatibility Analysis. - Nawal Guermouche; Olivier Perrin 001; Christophe Ringeissen (WWV, 2007)

Dynamic Web Services Provisioning with Constraints. - Éric Monfroy; Olivier Perrin 001; Christophe Ringeissen (OTM Conferences (1), 2008)

A Mediator Based Approach For Services Composition. - Nawal Guermouche; Olivier Perrin 001; Christophe Ringeissen (SERA, 2008)

Modelando la composición de servicios web con restricciones. - Éric Monfroy; Oliver Perri; Christophe Ringeissen (Rev. Avances en Sistemas Informática, 2008)

Raisonnement équationnel et méthodes de combinaison: de la programmation à la preuve. (Equational reasoning and combination methods: from programs to proofs). - Christophe Ringeissen (2009)

Combinable Extensions of Abelian Groups. - Enrica Nicolini; Christophe Ringeissen; Michaël Rusinowitch (CADE, 2009)

Data Structures with Arithmetic Constraints: A Non-disjoint Combination. - Enrica Nicolini; Christophe Ringeissen; Michaël Rusinowitch (FroCoS, 2009)

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. - Enrica Nicolini; Christophe Ringeissen; Michaël Rusinowitch (TACAS, 2009)

Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator. - Enrica Nicolini; Christophe Ringeissen; Michaël Rusinowitch (Fundam. Informaticae, 2010)

Combination of convex theories: Modularity, deduction completeness, and explanation. - Duc-Khanh Tran; Christophe Ringeissen; Silvio Ranise; Hélène Kirchner (J. Symb. Comput., 2010)

Modular Termination and Combinability for Superposition Modulo Counter Arithmetic. - Christophe Ringeissen; Valerio Senni (FroCoS, 2011)

Automatic decidability and combinability. - Christopher Lynch; Silvio Ranise; Christophe Ringeissen; Duc-Khanh Tran (Inf. Comput., 2011)

A Rule-Based Framework for Building Superposition-Based Decision Procedures. - Elena Tushkanova; Alain Giorgetti; Christophe Ringeissen; Olga Kouchnarenko (WRLA, 2012)

Hierarchical Combination. - Serdar Erbatur; Deepak Kapur; Andrew M. Marshall; Paliath Narendran; Christophe Ringeissen (CADE, 2013)

Hierarchical Combination of Unication Algorithms (Extended Abstract). - Serdar Erbatur; Deepak Kapur; Andrew M. Marshall; Paliath Narendran; Christophe Ringeissen (UNIF@RTA/TLCA, 2013)

Automatic Decidability: A Schematic Calculus for Theories with Counting Operators. - Elena Tushkanova; Christophe Ringeissen; Alain Giorgetti; Olga Kouchnarenko (RTA, 2013)

A Gentle Non-disjoint Combination of Satisfiability Procedures. - Paula Daniela Chocron; Pascal Fontaine; Christophe Ringeissen (IJCAR, 2014)

On Asymmetric Unification and the Combination Problem in Disjoint Theories. - Serdar Erbatur; Deepak Kapur; Andrew M. Marshall; Catherine Meadows 001; Paliath Narendran; Christophe Ringeissen (FoSSaCS, 2014)

On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). - Serdar Erbatur; Deepak Kapur; Andrew M. Marshall; Catherine Meadows 001; Paliath Narendran; Christophe Ringeissen (UNIF, 2014)

Hierarchical Combination of Matching Algorithms (Extended Abstract). - Serdar Erbatur; Deepak Kapur; Andrew M. Marshall; Paliath Narendran; Christophe Ringeissen (UNIF, 2014)

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited. - Paula Daniela Chocron; Pascal Fontaine; Christophe Ringeissen (CADE, 2015)

A Rewriting Approach to the Combination of Data Structures with Bridging Theories. - Paula Daniela Chocron; Pascal Fontaine; Christophe Ringeissen (FroCos, 2015)

Unification and Matching in Hierarchical Combinations of Syntactic Theories. - Serdar Erbatur; Deepak Kapur; Andrew M. Marshall; Paliath Narendran; Christophe Ringeissen (FroCos, 2015)

A rule-based system for automatic decidability and combinability. - Elena Tushkanova; Alain Giorgetti; Christophe Ringeissen; Olga Kouchnarenko (Sci. Comput. Program., 2015)

Satisfiability Modulo Free Data Structures Combined with Bridging Functions. - Raphaël Berthon; Christophe Ringeissen (SMT@IJCAR, 2016)

Notions of Knowledge in Combinations of Theories Sharing Constructors. - Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (CADE, 2017)

Theory Combination: Beyond Equality Sharing. - Maria Paola Bonacina; Pascal Fontaine; Christophe Ringeissen; Cesare Tinelli (Description Logic, Theory Combination, and All That, 2019)

Building and Combining Matching Algorithms. - Christophe Ringeissen (Description Logic, Theory Combination, and All That, 2019)

Rule-Based Unification in Combined Theories and the Finite Variant Property. - Ajay Kumar Eeralla; Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (LATA, 2019)

Politeness for the Theory of Algebraic Datatypes. - Ying Sheng 007; Yoni Zohar; Christophe Ringeissen; Jane Lange; Pascal Fontaine; Clark W. Barrett (IJCAR (1), 2020)

Terminating Non-disjoint Combined Unification. - Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (LOPSTR, 2020)

Terminating Non-Disjoint Combined Unification (Extended Abstract). - Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (UNIF, 2020)

Politeness and Combination Methods for Theories with Bridging Functions. - Paula Daniela Chocron; Pascal Fontaine; Christophe Ringeissen (J. Autom. Reason., 2020)

Computing knowledge in equational extensions of subterm convergent theories. - Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (Math. Struct. Comput. Sci., 2020)

Politeness and Stable Infiniteness: Stronger Together. - Ying Sheng 007; Yoni Zohar; Christophe Ringeissen; Andrew Reynolds 001; Clark W. Barrett; Cesare Tinelli (CADE, 2021)

Non-disjoint Combined Unification and Closure by Equational Paramodulation. - Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (FroCoS, 2021)

Politeness for the Theory of Algebraic Datatypes (Extended Abstract). - Ying Sheng 007; Yoni Zohar; Christophe Ringeissen; Jane Lange; Pascal Fontaine; Clark W. Barrett (IJCAI, 2021)

Combined Hierarchical Matching: the Regular Case. - Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (FSCD, 2022)

Polite Combination of Algebraic Datatypes. - Ying Sheng 007; Yoni Zohar; Christophe Ringeissen; Jane Lange; Pascal Fontaine; Clark W. Barrett (J. Autom. Reason., 2022)

Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories. - Saraid Dwyer Satterfield; Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (FSCD, 2023)

Combining Stable Infiniteness and (Strong) Politeness. - Ying Sheng 007; Yoni Zohar; Christophe Ringeissen; Andrew Reynolds 001; Clark W. Barrett; Cesare Tinelli (J. Autom. Reason., 2023)

Deciding Knowledge Problems Modulo Classes of Permutative Theories. - Serdar Erbatur; Andrew M. Marshall; Paliath Narendran; Christophe Ringeissen (LOPSTR, 2024)

Combined Abstract Congruence Closure for Theories with Associativity or Commutativity. - Christophe Ringeissen; Laurent Vigneron (LOPSTR, 2024)

Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent. - Carter Bunch; Saraid Dwyer Satterfield; Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen (CoRR, 2024)

Combining Generalization Algorithms in Regular Collapse-Free Theories. - Mauricio Ayala-Rincón; David M. Cerna; Temur Kutsia; Christophe Ringeissen (FSCD, 2025)

Knowledge Problems vs Unification and Matching: Dichotomy Results. - Serdar Erbatur; Andrew M. Marshall; Paliath Narendran; Christophe Ringeissen (FSCD, 2025)

Interpolating Parametric Array Theories. - Rodrigo Raya; Christophe Ringeissen (JELIA (2), 2025)