default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Ringeissen
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c62]Serdar Erbatur
, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Deciding Knowledge Problems Modulo Classes of Permutative Theories. LOPSTR 2024: 47-63- [c61]Christophe Ringeissen, Laurent Vigneron:
Combined Abstract Congruence Closure for Theories with Associativity or Commutativity. LOPSTR 2024: 82-98 - [i4]Carter Bunch, Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent. CoRR abs/2401.17226 (2024) - 2023
- [j17]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
Combining Stable Infiniteness and (Strong) Politeness. J. Autom. Reason. 67(4): 34 (2023) - [c60]Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories. FSCD 2023: 30:1-30:19 - 2022
- [j16]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Polite Combination of Algebraic Datatypes. J. Autom. Reason. 66(3): 331-355 (2022) - [c59]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Combined Hierarchical Matching: the Regular Case. FSCD 2022: 6:1-6:22 - 2021
- [c58]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
Politeness and Stable Infiniteness: Stronger Together. CADE 2021: 148-165 - [c57]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Non-disjoint Combined Unification and Closure by Equational Paramodulation. FroCoS 2021: 25-42 - [c56]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Politeness for the Theory of Algebraic Datatypes (Extended Abstract). IJCAI 2021: 4829-4833 - [i3]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
Politeness and Stable Infiniteness: Stronger Together. CoRR abs/2104.11738 (2021) - 2020
- [j15]Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen:
Politeness and Combination Methods for Theories with Bridging Functions. J. Autom. Reason. 64(1): 97-134 (2020) - [j14]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Computing knowledge in equational extensions of subterm convergent theories. Math. Struct. Comput. Sci. 30(6): 683-709 (2020) - [c55]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Politeness for the Theory of Algebraic Datatypes. IJCAR (1) 2020: 238-255 - [c54]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Terminating Non-disjoint Combined Unification. LOPSTR 2020: 113-130 - [c53]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Terminating Non-Disjoint Combined Unification (Extended Abstract). UNIF 2020: 7:1-7:6 - [i2]Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, Clark W. Barrett:
Politeness for the Theory of Algebraic Datatypes. CoRR abs/2004.04854 (2020)
2010 – 2019
- 2019
- [c52]Maria Paola Bonacina, Pascal Fontaine, Christophe Ringeissen, Cesare Tinelli:
Theory Combination: Beyond Equality Sharing. Description Logic, Theory Combination, and All That 2019: 57-89 - [c51]Christophe Ringeissen:
Building and Combining Matching Algorithms. Description Logic, Theory Combination, and All That 2019: 523-541 - [c50]Ajay Kumar Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Rule-Based Unification in Combined Theories and the Finite Variant Property. LATA 2019: 356-367 - 2017
- [c49]Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Notions of Knowledge in Combinations of Theories Sharing Constructors. CADE 2017: 60-76 - 2016
- [c48]Raphaël Berthon, Christophe Ringeissen:
Satisfiability Modulo Free Data Structures Combined with Bridging Functions. SMT@IJCAR 2016: 71-80 - 2015
- [j13]Elena Tushkanova, Alain Giorgetti, Christophe Ringeissen, Olga Kouchnarenko:
A rule-based system for automatic decidability and combinability. Sci. Comput. Program. 99: 3-23 (2015) - [c47]Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen:
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited. CADE 2015: 419-433 - [c46]Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen:
A Rewriting Approach to the Combination of Data Structures with Bridging Theories. FroCos 2015: 275-290 - [c45]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Unification and Matching in Hierarchical Combinations of Syntactic Theories. FroCos 2015: 291-306 - 2014
- [c44]Paula Daniela Chocron, Pascal Fontaine, Christophe Ringeissen:
A Gentle Non-disjoint Combination of Satisfiability Procedures. IJCAR 2014: 122-136 - [c43]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories. FoSSaCS 2014: 274-288 - [c42]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:
On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract). UNIF 2014: 33-35 - [c41]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Matching Algorithms (Extended Abstract). UNIF 2014: 36-40 - [e5]Temur Kutsia, Christophe Ringeissen:
Proceedings of the 28th International Workshop on Unification, UNIF 2014, Vienna, Austria, July 13, 2014. 2014 [contents] - 2013
- [c40]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination. CADE 2013: 249-266 - [c39]Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen:
Hierarchical Combination of Unication Algorithms (Extended Abstract). UNIF@RTA/TLCA 2013: 30-34 - [c38]Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti, Olga Kouchnarenko:
Automatic Decidability: A Schematic Calculus for Theories with Counting Operators. RTA 2013: 303-318 - [e4]Pascal Fontaine, Christophe Ringeissen, Renate A. Schmidt:
Frontiers of Combining Systems - 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings. Lecture Notes in Computer Science 8152, Springer 2013, ISBN 978-3-642-40884-7 [contents] - 2012
- [c37]Elena Tushkanova, Alain Giorgetti, Christophe Ringeissen, Olga Kouchnarenko:
A Rule-Based Framework for Building Superposition-Based Decision Procedures. WRLA 2012: 221-239 - 2011
- [j12]Christopher Lynch, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Automatic decidability and combinability. Inf. Comput. 209(7): 1026-1047 (2011) - [c36]Christophe Ringeissen, Valerio Senni:
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic. FroCoS 2011: 211-226 - [i1]Christophe Ringeissen, Valerio Senni:
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 64-65 - 2010
- [j11]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator. Fundam. Informaticae 105(1-2): 163-187 (2010) - [j10]Duc-Khanh Tran, Christophe Ringeissen, Silvio Ranise, Hélène Kirchner:
Combination of convex theories: Modularity, deduction completeness, and explanation. J. Symb. Comput. 45(2): 261-286 (2010)
2000 – 2009
- 2009
- [b2]Christophe Ringeissen:
Raisonnement équationnel et méthodes de combinaison: de la programmation à la preuve. (Equational reasoning and combination methods: from programs to proofs). Henri Poincaré University, Nancy, France, 2009 - [c35]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Combinable Extensions of Abelian Groups. CADE 2009: 51-66 - [c34]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Data Structures with Arithmetic Constraints: A Non-disjoint Combination. FroCoS 2009: 319-334 - [c33]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. TACAS 2009: 428-442 - 2008
- [j9]Éric Monfroy, Oliver Perri, Christophe Ringeissen:
Modelando la composición de servicios web con restricciones. Rev. Avances en Sistemas Informática 5(1): 173-179 (2008) - [c32]Éric Monfroy, Olivier Perrin, Christophe Ringeissen:
Dynamic Web Services Provisioning with Constraints. OTM Conferences (1) 2008: 26-43 - [c31]Nawal Guermouche, Olivier Perrin, Christophe Ringeissen:
A Mediator Based Approach For Services Composition. SERA 2008: 273-280 - 2007
- [c30]Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Combining Proof-Producing Decision Procedures. FroCoS 2007: 237-251 - [c29]Nawal Guermouche, Olivier Perrin, Christophe Ringeissen:
Timed Specification For Web Services Compatibility Analysis. WWV 2007: 155-170 - 2006
- [j8]Alessandro Armando, Christophe Ringeissen:
Special issue on combining logical systems. Inf. Comput. 204(10): 1411-1412 (2006) - [c28]David Déharbe, Pascal Fontaine, Silvio Ranise, Christophe Ringeissen:
Decision Procedures for the Formal Analysis of Software. ICTAC 2006: 366-370 - [c27]Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Automatic Combinability of Rewriting-Based Satisfiability Procedures. LPAR 2006: 542-556 - 2005
- [c26]Silvio Ranise, Christophe Ringeissen, Calogero G. Zarba:
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic. FroCoS 2005: 48-64 - [c25]Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
On Superposition-Based Satisfiability Procedures and Their Combination. ICTAC 2005: 594-608 - [e3]Slim Abdennadher, Christophe Ringeissen:
Proceedings of the 5th International Workshop on Rule-Based Programming, RULE 2004, Aachen, Germany, June 1, 2004. Electronic Notes in Theoretical Computer Science 124(1), Elsevier 2005 [contents] - 2004
- [j7]Anamaria Martins Moreira, Christophe Ringeissen, David Déharbe, Gleydson Lima:
Manipulating algebraic specifications with term-based and graph-based representations. J. Log. Algebraic Methods Program. 59(1-2): 63-87 (2004) - [c24]Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn. ICTAC 2004: 372-386 - [c23]Slim Abdennadher, Christophe Ringeissen:
Preface. RULE@RDP 2004: 1-2 - 2003
- [j6]Cesare Tinelli, Christophe Ringeissen:
Unions of non-disjoint theories and combinations of satisfiability procedures. Theor. Comput. Sci. 290(1): 291-353 (2003) - [c22]Christophe Ringeissen:
Matching in a Class of Combined Non-disjoint Theories. CADE 2003: 212-227 - [c21]Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek:
A Pattern Matching Compiler for Multiple Target Languages. CC 2003: 61-76 - [c20]Carlos Castro, Éric Monfroy, Christophe Ringeissen:
A Rule Language for Interaction. CSCLP 2003: 154-170 - [c19]Anamaria Martins Moreira, Christophe Ringeissen, Anderson Santana:
A Tool Support for Reusing ELAN Rule-Based Components. RULE@RDP 2003: 77-91 - 2002
- [c18]David Déharbe, Anamaria Martins Moreira, Christophe Ringeissen:
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae. RTA 2002: 207-221 - [c17]Mark van den Brand, Pierre-Etienne Moreau, Christophe Ringeissen:
The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration. LDTA@ETAPS 2002: 50-56 - [e2]Hélène Kirchner, Christophe Ringeissen:
Algebraic Methodology and Software Technology, 9th International Conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9-13, 2002, Proceedings. Lecture Notes in Computer Science 2422, Springer 2002, ISBN 3-540-44144-1 [contents] - 2001
- [j5]Peter Borovanský, Claude Kirchner, Hélène Kirchner, Christophe Ringeissen:
Rewriting with Strategies in ELAN: A Functional Semantics. Int. J. Found. Comput. Sci. 12(1): 69-95 (2001) - [c16]Christophe Ringeissen:
Matching with Free Function Symbols - A Simple Extension of Matching? RTA 2001: 276-290 - [c15]Pierre-Etienne Moreau, Christophe Ringeissen, Marian Vittek:
Pattern-Matching Compiler. LDTA@ETAPS 2001: 161-180 - 2000
- [c14]Mark van den Brand, Christophe Ringeissen:
ASF+SDF parsing tools applied to ELAN. WRLA 2000: 138-157 - [c13]Christophe Ringeissen:
Handling Relations over Finite Domains in the Rule-Based System ELAN. WRLA 2000: 194-211 - [e1]Hélène Kirchner, Christophe Ringeissen:
Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000, Proceedings. Lecture Notes in Computer Science 1794, Springer 2000, ISBN 3-540-67281-8 [contents]
1990 – 1999
- 1999
- [j4]Éric Monfroy, Christophe Ringeissen:
An Open Automated Framework for Constraint Solver Extension: the SoleX Approach. Fundam. Informaticae 39(1-2): 167-187 (1999) - [c12]Christophe Ringeissen, Éric Monfroy:
Generating Propagation Rules for Finite Domains: A Mixed Approach. New Trends in Constraints 1999: 150-172 - 1998
- [j3]Claude Kirchner, Christophe Ringeissen:
Rule-Based Constraint Programming. Fundam. Informaticae 34(3): 225-262 (1998) - [c11]Éric Monfroy, Christophe Ringeissen:
SoleX: A Domain-Independent Scheme for Constraint Solver Extension. AISC 1998: 222-233 - [c10]Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, Christophe Ringeissen:
An overview of ELAN. WRLA 1998: 55-70 - [c9]Peter Borovanský, Salma Jamoussi, Pierre-Etienne Moreau, Christophe Ringeissen:
Handling ELAN rewrite programs via an exchange format. WRLA 1998: 173 - 1997
- [c8]Claude Kirchner, Christophe Ringeissen:
Higher-Order Equational Unification via Explicit Substitutions. ALP/HOA 1997: 61-75 - [c7]Christophe Ringeissen:
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language. RTA 1997: 323-326 - 1996
- [j2]Christophe Ringeissen:
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories. Inf. Comput. 126(2): 144-160 (1996) - [c6]Christophe Ringeissen:
Cooperation of Decision Procedures for the Satisfiability Problem. FroCoS 1996: 121-139 - 1994
- [j1]Hélène Kirchner, Christophe Ringeissen:
Combining Symbolic Constraint Solvers on Algebraic Domains. J. Symb. Comput. 18(2): 113-155 (1994) - [c5]Eric Domenjoud, Francis Klay, Christophe Ringeissen:
Combination Techniques for Non-Disjoint Equational Theories. CADE 1994: 267-281 - [c4]Hélène Kirchner, Christophe Ringeissen:
Constraint Solving by Narrowing in Combined Algebraic Domains. ICLP 1994: 617-631 - [c3]Christophe Ringeissen:
Combination of Matching Algorithms. STACS 1994: 187-198 - 1993
- [b1]Christophe Ringeissen:
Combinaison de résolutions de contraintes. (Combination of constraint solvers). Henri Poincaré University, Nancy, France, 1993 - 1992
- [c2]Hélène Kirchner, Christophe Ringeissen:
A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms. JICSLP 1992: 225-239 - [c1]Christophe Ringeissen:
Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras. LPAR 1992: 261-272
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
