Christophe Ringeissen

From MaRDI portal
Person:831918

Available identifiers

zbMath Open ringeissen.christopheMaRDI QIDQ831918

List of research outcomes





PublicationDate of PublicationType
Knowledge problems in security protocols: going beyond subterm convergent theories2024-10-21Paper
Combined hierarchical matching: the regular case2024-05-27Paper
Combining stable infiniteness and (strong) politeness2023-10-24Paper
Politeness for the theory of algebraic datatypes2022-11-09Paper
Polite combination of algebraic datatypes2022-10-24Paper
Non-disjoint combined unification and closure by equational paramodulation2022-03-24Paper
Terminating non-disjoint combined unification2022-03-23Paper
Politeness and stable infiniteness: stronger together2021-12-01Paper
Computing knowledge in equational extensions of subterm convergent theories2020-12-08Paper
Theory combination: beyond equality sharing2020-06-04Paper
Building and combining matching algorithms2020-06-04Paper
Politeness and combination methods for theories with bridging functions2020-03-03Paper
Combination techniques for non-disjoint equational theories2020-01-21Paper
Rule-based unification in combined theories and the finite variant property2019-12-04Paper
Prototyping combination of unification algorithms with the ELAN rule-based programming language2017-11-17Paper
Notions of knowledge in combinations of theories sharing constructors2017-09-22Paper
A Rewriting Approach to the Combination of Data Structures with Bridging Theories2017-02-27Paper
Unification and Matching in Hierarchical Combinations of Syntactic Theories2017-02-27Paper
Automatic Decidability: A Schematic Calculus for Theories with Counting Operators2017-02-01Paper
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited2015-12-02Paper
REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS2015-04-30Paper
A Gentle Non-disjoint Combination of Satisfiability Procedures2014-09-26Paper
On Asymmetric Unification and the Combination Problem in Disjoint Theories2014-04-16Paper
Hierarchical Combination2013-06-14Paper
A Rule-Based Framework for Building Superposition-Based Decision Procedures2012-10-16Paper
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic2011-10-07Paper
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator2011-03-28Paper
Automated Deduction – CADE-192010-04-20Paper
Data Structures with Arithmetic Constraints: A Non-disjoint Combination2010-01-07Paper
Combination of convex theories: modularity, deduction completeness, and explanation2009-12-03Paper
Combinable Extensions of Abelian Groups2009-07-28Paper
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets2009-03-31Paper
Combining Proof-Producing Decision Procedures2008-09-16Paper
Automatic Combinability of Rewriting-Based Satisfiability Procedures2008-05-27Paper
Theoretical Aspects of Computing – ICTAC 20052006-11-01Paper
Frontiers of Combining Systems2006-10-10Paper
Theoretical Aspects of Computing - ICTAC 20042005-11-30Paper
Manipulating algebraic specifications with term-based and graph-based representations2004-11-12Paper
https://portal.mardi4nfdi.de/entity/Q48087482004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44177832003-07-30Paper
Unions of non-disjoint theories and combinations of satisfiability procedures2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q27788842002-03-21Paper
ASF+SDF parsing tools applied to ELAN2001-05-07Paper
Handling relations over finite domains in the rule-based system ELAN2001-05-07Paper
https://portal.mardi4nfdi.de/entity/Q43854402000-10-08Paper
https://portal.mardi4nfdi.de/entity/Q49426542000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q49341462000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q42641991999-09-16Paper
https://portal.mardi4nfdi.de/entity/Q42555121999-08-16Paper
https://portal.mardi4nfdi.de/entity/Q42230011999-01-07Paper
https://portal.mardi4nfdi.de/entity/Q42229911999-01-07Paper
https://portal.mardi4nfdi.de/entity/Q43643701997-11-17Paper
Combining decision algorithms for matching in the union of disjoint equational theories1997-01-12Paper
Combining symbolic constraint solvers on algebraic domains1994-12-18Paper

Research outcomes over time

This page was built for person: Christophe Ringeissen