Filter your results
- 58
- 38
- 58
- 18
- 14
- 2
- 1
- 1
- 1
- 1
- 13
- 92
- 1
- 3
- 4
- 5
- 4
- 1
- 2
- 1
- 4
- 5
- 5
- 2
- 2
- 3
- 6
- 5
- 3
- 4
- 4
- 3
- 7
- 5
- 3
- 3
- 4
- 5
- 1
- 1
- 94
- 2
- 95
- 65
- 44
- 41
- 12
- 4
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 96
- 13
- 12
- 10
- 10
- 7
- 7
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
96 Results
A Gentle Non-Disjoint Combination of Satisfiability ProceduresAutomated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Jul 2014, Vienna, Austria. pp.122-136, ⟨10.1007/978-3-319-08587-6_9⟩
Conference papers
hal-01087162v1
|
|||
Generating Propagation Rules for Finite Domains: a Mixed ApproachJoint ERCIM/Compulog Net Workshop, 1999, Paphos, Cyprus, pp.150-172
Conference papers
inria-00099387v1
|
|||
Matching with Free Function Symbols -- A Simple Extension of Matching?International Conference on Rewriting Techniques and Applications - RTA'2001, Vincent van Oostrom, 2001, Utrecht, The Netherlands, pp.276--290
Conference papers
inria-00108076v1
|
|||
A Pattern-Matching CompilerFirst Workshop on Language Descriptions, Tools and Applications - LDTA'01, Apr 2001, Genova, Italy, 14 p
Conference papers
inria-00100437v1
|
|||
An Overview of ELANSecond Workshop on Rewriting Logic and its Applications - WRLA'98, 1998, Pont-à-Mousson, France, 16 p
Conference papers
inria-00098518v1
|
|||
Building and Combining Satisfiability Procedures for Software VerificationThird Taiwanese-French Conference on Information Technology (TFIT), Mar 2006, Nancy, France, pp.125--139
Conference papers
inria-00117390v1
|
|||
|
Unification in Non-Disjoint Combinations with Forward-Closed Theories[Research Report] RR-9252, Inria Nancy - Grand Est. 2019
Reports
hal-02006179v1
|
||
|
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets[Research Report] RR-6697, INRIA. 2008, pp.22
Reports
inria-00331735v2
|
||
|
Automatic Decidability for Theories with Counting OperatorsAutomated Deduction: Decidability, Complexity, Tractability (workshop ADDCT), Jun 2013, Lake Placid, United States
Conference papers
hal-00920496v1
|
||
A Mediator Based Approach For Services CompositionInternational Conference on Software Engineering Research, Management and Applications (SERA'08), Aug 2008, Prague, Czech Republic
Conference papers
inria-00275221v1
|
|||
|
Terminating Non-Disjoint Combined UnificationLOPSTR 2020 - 30th International Symposium on Logic-based Program Synthesis and Transformation, Maurizio Gabbrielli, Sep 2020, Bologna, Italy. pp.113-130, ⟨10.1007/978-3-030-68446-4_6⟩
Conference papers
hal-02967029v2
|
||
Data Structures with Arithmetic Constraints: a Non-disjoint Combination7th International Symposium on Frontiers of Combining Systems - FroCoS'2009, Sep 2009, Trento, Italy. pp.335-350, ⟨10.1007/978-3-642-04222-5_20⟩
Conference papers
istex
inria-00428421v1
|
|||
Modular Termination and Combinability for Superposition Modulo Counter ArithmeticFrontiers of Combining Systems, 8th International Symposium, FroCoS'2011, Oct 2011, Saarbruecken, Germany. pp.211-226, ⟨10.1007/978-3-642-24364-6_15⟩
Conference papers
istex
inria-00636589v1
|
|||
Combining Proof-Producing Decision Procedures6th International Symposium o Frontiers of Combining Systems - FroCoS 2007, Boris Konev and Frank Wolter, Sep 2007, Liverpool, United Kingdom. pp.237-251, ⟨10.1007/978-3-540-74621-8_16⟩
Conference papers
istex
inria-00187425v1
|
|||
|
A Tool Support for Reusing ELAN Rule-Based ComponentsElectronic Notes in Theoretical Computer Science, 2003, 86 (2), pp.77-91. ⟨10.1016/S1571-0661(04)80677-7⟩
Journal articles
inria-00000752v1
|
||
Improving Symbolic Model Checking by Rewriting Temporal Logic FormulaeInternational Conference on Rewriting Techniques and Applications - RTA'2002, Thomas Arts, Jul 2002, Copenhagen, Denmark, pp.207-221
Conference papers
inria-00100863v1
|
|||
Algebraic Methodology And Software Technology9th International Conference on Algebraic Methodology And Software Technology - AMAST'2002, Sep 2002, Saint-Gilles-les-Bains, Reunion Island, France, XI-501 p
Conference papers
inria-00100866v1
|
|||
ASF+SDF parsing tools applied to ELANThird International Workshop on Rewriting Logic & Applications - WRLA'2000, 2000, Kanazawa, Japon, 20 p
Conference papers
inria-00099385v1
|
|||
|
Combinaison de résolutions de contraintesInformatique [cs]. Université Henri Poincaré - Nancy 1, 1993. Français. ⟨NNT : 1993NAN10369⟩
Theses
tel-01747147v1
|
||
|
Politeness and Stable Infiniteness: Stronger TogetherCADE 2021 - 28th International Conference on Automated Deduction, Jul 2021, Pittsburgh, PA / online, United States. pp.148-165, ⟨10.1007/978-3-030-79876-5_9⟩
Conference papers
hal-03346663v1
|
||
|
A rule-based system for automatic decidability and combinabilityScience of Computer Programming, 2015, Selected Papers from the Ninth International Workshop on Rewriting Logic and its Applications (WRLA 2012), 99, pp.3-23. ⟨10.1016/j.scico.2014.02.005⟩
Journal articles
hal-01102883v1
|
||
|
A Gentle Non-Disjoint Combination of Satisfiability Procedures (Extended Version)[Research Report] RR-8529, INRIA. 2014
Reports
hal-00985135v1
|
||
|
Politeness and Combination Methods for Theories with Bridging FunctionsJournal of Automated Reasoning, 2020, 64, pp.97-134. ⟨10.1007/s10817-019-09512-4⟩
Journal articles
hal-01988452v1
|
||
Dynamic Web Services Provisioning with ConstraintsInternational Conference on Cooperative Information Systems, OTM Conferences, Nov 2008, Monterrey, Mexico. pp.26-43
Conference papers
inria-00329815v1
|
|||
Timed Specification For Web Services Compatibility AnalysisInternational Workshop on Automated Specification and Verification of Web Systems - WWV 2007, Dec 2007, San Servolo island, Venice, Italy
Conference papers
inria-00190978v1
|
|||
|
Satisfiability Modulo Free Data Structures Combined with Bridging Functions14th International Workshop on Satisfiability Modulo Theories, affiliated with IJCAR 2016, Jul 2016, Coimbra, Portugal. pp.71--80
Conference papers
hal-01389228v1
|
||
|
Notions of Knowledge in Combinations of Theories Sharing Constructors26th International Conference on Automated Deduction, Aug 2017, Göteborg, Sweden. pp.60 - 76, ⟨10.1007/978-3-319-63046-5_5⟩
Conference papers
hal-01587181v1
|
||
|
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited25th International Conference on Automated Deduction, CADE-25, Christoph Benzmueller, Aug 2015, Berlin, Germany. pp.419-433, ⟨10.1007/978-3-319-21401-6_29⟩
Conference papers
hal-01157898v1
|
||
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting OperatorFundamenta Informaticae, 2010, 105 (1-2), pp.163--187. ⟨10.3233/FI-2010-362⟩
Journal articles
inria-00526683v1
|
|||
Producing Conflict Sets for Combination of TheoriesWorkshop on Pragmatics of Decision Procedures in Automated Reasoning - PDPAR 2006, Aug 2006, Seattle, WA/USA
Conference papers
inria-00117399v1
|