Person: Christophe Ringeissen

DBLP: Ringeissen:Christophe

Contributed to:

2015

2014

2014

2013

2013

2012

2009

2009

2003

2003

2002

2002

2001

2001

2000

2001

1998

1997

1997

1994

1994

1992

2017

Wrote 25 papers:

CADE-2015-ChocronFR #revisited

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (PC, PF, CR), pp. 419–433.

FoSSaCS-2014-ErbaturKMMNR #on the #problem #symmetry #unification

On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.

IJCAR-2014-ChocronFR #satisfiability

A Gentle Non-disjoint Combination of Satisfiability Procedures (PC, PF, CR), pp. 122–136.

CADE-2013-ErbaturKMNR

Hierarchical Combination (SE, DK, AMM, PN, CR), pp. 249–266.

RTA-2013-TushkanovaRGK #automation #calculus #decidability

Automatic Decidability: A Schematic Calculus for Theories with Counting Operators (ET, CR, AG, OK), pp. 303–318.

WRLA-2012-TushkanovaGRK #framework #rule-based

A Rule-Based Framework for Building Superposition-Based Decision Procedures (ET, AG, CR, OK), pp. 221–239.

CADE-2009-NicoliniRR

Combinable Extensions of Abelian Groups (EN, CR, MR), pp. 51–66.

TACAS-2009-NicoliniRR #integer #satisfiability

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (EN, CR, MR), pp. 428–442.

CADE-2003-Ringeissen

Matching in a Class of Combined Non-disjoint Theories (CR), pp. 212–227.

CC-2003-MoreauRV #compilation #multi #pattern matching

A Pattern Matching Compiler for Multiple Target Languages (PEM, CR, MV), pp. 61–76.

LDTA-2002-BrandMR #asf+sdf #logic

The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology — System Demonstration (MvdB, PEM, CR), pp. 50–56.

RTA-2002-DeharbeMR #logic #model checking

Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae (DD, AMM, CR), pp. 207–221.

LDTA-2001-MoreauRV #compilation #pattern matching

Pattern-Matching Compiler (PEM, CR, MV), pp. 161–180.

RTA-2001-Ringeissen #question

Matching with Free Function Symbols — A Simple Extension of Matching? (CR), pp. 276–290.

WRLA-2000-BrandR #asf+sdf #parsing #tool support

ASF+SDF parsing tools applied to ELAN (MvdB, CR), pp. 138–157.

WRLA-2000-Ringeissen #finite #rule-based

Handling Relations over Finite Domains in the Rule-Based System ELAN (CR), pp. 194–211.

FLOPS-J1-1998-BorovanskyKKR01 #functional #semantics

Rewriting with Strategies in ELAN: A Functional Semantics (PB, CK, HK, CR), pp. 69–95.

WRLA-1998-BorovanskyJMR #source code

Handling ELAN rewrite programs via an exchange format (PB, SJ, PEM, CR), p. 173.

WRLA-1998-BorovanskyKKMR #overview

An overview of ELAN (PB, CK, HK, PEM, CR), pp. 55–70.

ALP-1997-KirchnerR #equation #higher-order #unification

Higher-Order Equational Unification via Explicit Substitutions (CK, CR), pp. 61–75.

RTA-1997-Ringeissen #algorithm #programming language #prototype #rule-based #unification

Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language (CR), pp. 323–326.

CADE-1994-DomenjoudKR #equation

Combination Techniques for Non-Disjoint Equational Theories (ED, FK, CR), pp. 267–281.

ICLP-1994-KirchnerR #algebra #constraints #theorem proving

Constraint Solving by Narrowing in Combined Algebraic Domains (HK, CR), pp. 617–631.

JICSLP-1992-KirchnerR #algebra #algorithm #constraints #finite #theorem proving #unification

A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms (HK, CR), pp. 225–239.

CADE-2017-ErbaturMR

Notions of Knowledge in Combinations of Theories Sharing Constructors (SE, AMM, CR), pp. 60–76.