Christophe Ringeissen

Olga Kouchnarenko

Sci. Comput. Program., 2015

Unification and Matching in Hierarchical Combinations of Syntactic Theories.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

A Rewriting Approach to the Combination of Data Structures with Bridging Theories.

[BibT_eX]

[DOI]

Paula Daniela Chocron

Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited.

[BibT_eX]

[DOI]

Paula Daniela Chocron

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Hierarchical Combination of Matching Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Unification, 2014

On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Unification, 2014

On Asymmetric Unification and the Combination Problem in Disjoint Theories.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2014

A Gentle Non-disjoint Combination of Satisfiability Procedures.

[BibT_eX]

[DOI]

Paula Daniela Chocron

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013

Automatic Decidability: A Schematic Calculus for Theories with Counting Operators.

[BibT_eX]

[DOI]

Elena Tushkanova

Alain Giorgetti

Olga Kouchnarenko

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Hierarchical Combination of Unication Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 27th International Workshop on Unification, 2013

Hierarchical Combination.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-24, 2013

2012

A Rule-Based Framework for Building Superposition-Based Decision Procedures.

[BibT_eX]

[DOI]

Elena Tushkanova

Alain Giorgetti

Olga Kouchnarenko

Proceedings of the Rewriting Logic and Its Applications - 9th International Workshop, 2012

2011

Automatic decidability and combinability.

[BibT_eX]

[DOI]

Christopher Lynch

Inf. Comput., 2011

Modular Termination and Combinability for Superposition Modulo Counter Arithmetic.

[BibT_eX]

Valerio Senni

Proceedings of the TABLEAUX 2011, 2011

2010

Combination of convex theories: Modularity, deduction completeness, and explanation.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

2009

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

Data Structures with Arithmetic Constraints: A Non-disjoint Combination.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Combinable Extensions of Abelian Groups.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

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

[BibT_eX]

[DOI]

, 2009

2008

Modelando la composición de servicios web con restricciones.

[BibT_eX]

[DOI]

Oliver Perri

Rev. Avances en Sistemas Informática, 2008

A Mediator Based Approach For Services Composition.

[BibT_eX]

[DOI]

Nawal Guermouche

Olivier Perrin

Proceedings of the 6th ACIS International Conference on Software Engineering Research, 2008

Dynamic Web Services Provisioning with Constraints.

[BibT_eX]

[DOI]

Olivier Perrin

Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008, 2008

2007

Timed Specification For Web Services Compatibility Analysis.

[BibT_eX]

[DOI]

Nawal Guermouche

Olivier Perrin

Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems, 2007

Combining Proof-Producing Decision Procedures.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

2006

Special issue on combining logical systems.

[BibT_eX]

[DOI]

Alessandro Armando

Inf. Comput., 2006

Automatic Combinability of Rewriting-Based Satisfiability Procedures.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

Decision Procedures for the Formal Analysis of Software.

[BibT_eX]

[DOI]

David Déharbe

Proceedings of the Theoretical Aspects of Computing, 2006

2005

On Superposition-Based Satisfiability Procedures and Their Combination.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2005

Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic.

[BibT_eX]

[DOI]

Calogero G. Zarba

Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

2004

Manipulating algebraic specifications with term-based and graph-based representations.

[BibT_eX]

[DOI]

Anamaria Martins Moreira

David Déharbe

Gleydson Lima

J. Log. Algebraic Methods Program., 2004

Preface.

[BibT_eX]

[DOI]

Slim Abdennadher

Proceedings of the 5th International Workshop on Rule-Based Programming, 2004

Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2004

2003

Unions of non-disjoint theories and combinations of satisfiability procedures.

[BibT_eX]

[DOI]

Cesare Tinelli

Theor. Comput. Sci., 2003

A Tool Support for Reusing ELAN Rule-Based Components.

[BibT_eX]

[DOI]

Anamaria Martins Moreira

Anderson Santana

Proceedings of the 4th International Workshop on Rule-Based Programming, 2003

A Rule Language for Interaction.

[BibT_eX]

[DOI]

Carlos Castro

Proceedings of the Recent Advances in Constraints, 2003

A Pattern Matching Compiler for Multiple Target Languages.

[BibT_eX]

[DOI]

Marian Vittek

Proceedings of the Compiler Construction, 12th International Conference, 2003

Matching in a Class of Combined Non-disjoint Theories.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002

The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration.

[BibT_eX]

[DOI]

Mark van den Brand

Proceedings of the Second Workshop on Language Descriptions, Tools and Applications, 2002

Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.

[BibT_eX]

[DOI]

David Déharbe

Anamaria Martins Moreira

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001

Rewriting with Strategies in ELAN: A Functional Semantics.

[BibT_eX]

[DOI]

Peter Borovanský

Int. J. Found. Comput. Sci., 2001

Pattern-Matching Compiler.

[BibT_eX]

[DOI]

Marian Vittek

Proceedings of the First Workshop on Language Descriptions, Tools and Applications, 2001

Matching with Free Function Symbols - A Simple Extension of Matching?

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000

Handling Relations over Finite Domains in the Rule-Based System ELAN.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

ASF+SDF parsing tools applied to ELAN.

[BibT_eX]

[DOI]

Mark van den Brand

Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

1999

An Open Automated Framework for Constraint Solver Extension: the SoleX Approach.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

Generating Propagation Rules for Finite Domains: A Mixed Approach.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Contraints, 1999

1998

Rule-Based Constraint Programming.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

An overview of ELAN.

[BibT_eX]

[DOI]

Peter Borovanský

Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

Handling ELAN rewrite programs via an exchange format.

[BibT_eX]

[DOI]

Peter Borovanský

Salma Jamoussi

Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

SoleX: A Domain-Independent Scheme for Constraint Solver Extension.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1997

Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

Higher-Order Equational Unification via Explicit Substitutions.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1996

Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Cooperation of Decision Procedures for the Satisfiability Problem.

[BibT_eX]

Proceedings of the Frontiers of Combining Systems, 1996

1994

Combining Symbolic Constraint Solvers on Algebraic Domains.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

Combination of Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the STACS 94, 1994

Constraint Solving by Narrowing in Combined Algebraic Domains.

[BibT_eX]

Proceedings of the Logic Programming, 1994

Combination Techniques for Non-Disjoint Equational Theories.

[BibT_eX]

[DOI]

Eric Domenjoud

Francis Klay

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993

Combinaison de résolutions de contraintes. (Combination of constraint solvers).

[BibT_eX]

[DOI]

PhD thesis, 1993

1992

Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning, 1992

A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms.

[BibT_eX]