default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Peltier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Nicolas Peltier:
Some techniques for reasoning automatically on co-inductive data structures. J. Log. Comput. 34(3): 429-464 (2024)- [c69]Tanguy Bozec, Nicolas Peltier
, Quentin Petitjean, Mihaela Sighireanu:
What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment? IJCAR (2) 2024: 157-175 - [c68]Nicolas Peltier:
An EXPTIME-Complete Entailment Problem in Separation Logic. WoLLIC 2024: 157-174 - 2023
- [j46]Mnacho Echenim, Nicolas Peltier:
An undecidability result for Separation Logic with theory reasoning. Inf. Process. Lett. 182: 106359 (2023) - [j45]Mnacho Echenim, Nicolas Peltier:
A Proof Procedure for Separation Logic with Inductive Definitions and Data. J. Autom. Reason. 67(3): 30 (2023) - [c67]Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Strict Constrained Superposition Calculus for Graphs. FoSSaCS 2023: 135-155 - [c66]Nicolas Peltier:
Testing the Satisfiability of Formulas in Separation Logic with Permissions. TABLEAUX 2023: 427-445 - [i23]Mnacho Echenim, Nicolas Peltier:
Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates. CoRR abs/2305.08419 (2023) - 2022
- [j44]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules. Inf. Process. Lett. 173: 106169 (2022) - [j43]Nicolas Peltier, Viorica Sofronie-Stokkermans:
Special Issue of Selected Extended Papers of IJCAR 2020. J. Autom. Reason. 66(3): 275-276 (2022) - [c65]Nicolas Peltier:
Reasoning on Dynamic Transformations of Symbolic Heaps. TIME 2022: 9:1-9:20 - [i22]Mnacho Echenim, Nicolas Peltier:
A Proof Procedure For Separation Logic With Inductive Definitions and Theory Reasoning. CoRR abs/2201.13227 (2022) - [i21]Mnacho Echenim, Nicolas Peltier:
Two Results on Separation Logic With Theory Reasoning. CoRR abs/2206.09389 (2022) - 2021
- [c64]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Unifying Decidable Entailments in Separation Logic with Inductive Definitions. CADE 2021: 183-199 - [c63]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment. CSL 2021: 20:1-20:18 - [c62]Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Superposition-Based Calculus for Diagrammatic Reasoning. PPDP 2021: 10:1-10:13 - [i20]Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond. CoRR abs/2103.11709 (2021) - 2020
- [j42]Mnacho Echenim, Nicolas Peltier:
Combining Induction and Saturation-Based Theorem Proving. J. Autom. Reason. 64(2): 253-294 (2020) - [j41]Mnacho Echenim, Hervé Guiol, Nicolas Peltier:
Formalizing the Cox-Ross-Rubinstein Pricing of European Derivatives in Isabelle/HOL. J. Autom. Reason. 64(4): 737-765 (2020) - [j40]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates. ACM Trans. Comput. Log. 21(3): 19:1-19:46 (2020) - [c61]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. LPAR 2020: 191-211 - [p2]Thierry Boy de la Tour, Ricardo Caferra, Nicola Olivetti, Nicolas Peltier, Camilla Schwind:
Automated Deduction. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 53-81 - [e3]Nicolas Peltier, Viorica Sofronie-Stokkermans:
Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12166, Springer 2020, ISBN 978-3-030-51073-2 [contents] - [e2]Nicolas Peltier, Viorica Sofronie-Stokkermans:
Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12167, Springer 2020, ISBN 978-3-030-51053-4 [contents] - [i19]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. CoRR abs/2004.07578 (2020) - [i18]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems. CoRR abs/2007.00502 (2020) - [i17]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Checking Entailment Between Separation Logic Symbolic Heaps: Beyond Connected and Established Systems. CoRR abs/2012.14361 (2020)
2010 – 2019
- 2019
- [c60]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. FoSSaCS 2019: 242-259 - [c59]Mnacho Echenim, Nicolas Peltier, Yanis Sellami:
Ilinva: Using Abduction to Generate Loop Invariants. FroCos 2019: 77-93 - [c58]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Prenex Separation Logic with One Selector Field. TABLEAUX 2019: 409-427 - [i16]Mnacho Echenim, Nicolas Peltier, Yanis Sellami:
Ilinva: Using Abduction to Generate Loop Invariants. CoRR abs/1906.11033 (2019) - 2018
- [c57]Michael Peter Lettmann, Nicolas Peltier:
A Tableaux Calculus for Reducing Proof Size. IJCAR 2018: 64-80 - [c56]Mnacho Echenim, Nicolas Peltier, Yanis Sellami:
A Generic Framework for Implicate Generation Modulo Theories. IJCAR 2018: 279-294 - [c55]Jasmin Christian Blanchette, Nicolas Peltier, Simon Robillard:
Superposition with Datatypes and Codatatypes. IJCAR 2018: 370-387 - [c54]Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
Prime Implicate Generation in Equational Logic (extended abstract). IJCAI 2018: 5588-5592 - [i15]Michael Peter Lettmann, Nicolas Peltier:
A Tableaux Calculus for Reducing Proof Size. CoRR abs/1801.04163 (2018) - [i14]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic. CoRR abs/1802.00195 (2018) - [i13]Mnacho Echenim, Radu Iosif, Nicolas Peltier:
The Complexity of Prenex Separation Logic with One Selector. CoRR abs/1804.03556 (2018) - [i12]Mnacho Echenim, Nicolas Peltier, Yanis Sellami:
A Generic Framework for Implicate Generation Modulo Theories. CoRR abs/1807.04557 (2018) - [i11]Mnacho Echenim, Hervé Guiol, Nicolas Peltier:
Formalizing the Cox-Ross-Rubinstein pricing of European derivatives in Isabelle/HOL. CoRR abs/1807.09873 (2018) - 2017
- [j39]Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
Prime Implicate Generation in Equational Logic. J. Artif. Intell. Res. 60: 827-880 (2017) - [j38]Nicolas Peltier:
A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules. J. Log. Comput. 27(2): 549-576 (2017) - [j37]Alexander Leitsch, Nicolas Peltier, Daniel Weller:
CERES for first-order schemata. J. Log. Comput. 27(7): 1897-1954 (2017) - [c53]Mnacho Echenim, Nicolas Peltier:
The Binomial Pricing Model in Finance: A Formalization in Isabelle. CADE 2017: 546-562 - 2016
- [j36]Nicolas Peltier:
Propositional Resolution and Prime Implicates Generation. Arch. Formal Proofs 2016 (2016) - [j35]Nicolas Peltier:
A Variant of the Superposition Calculus. Arch. Formal Proofs 2016 (2016) - [j34]Mnacho Echenim, Nicolas Peltier:
A Superposition Calculus for Abductive Reasoning. J. Autom. Reason. 57(2): 97-134 (2016) - [j33]Thierry Boy de la Tour, Nicolas Peltier:
Proof Generalization in $$\mathrm {LK}$$ LK by Second Order Unifier Minimization. J. Autom. Reason. 57(3): 245-280 (2016) - 2015
- [c52]Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
Quantifier-Free Equational Logic and Prime Implicate Generation. CADE 2015: 311-325 - [c51]Tanguy Sassolas, Chiara Sandionigi, Alexandre Guerre, Julien Mottin, Pascal Vivet, Hela Boussetta, Nicolas Peltier:
A simulation framework for rapid prototyping and evaluation of thermal mitigation techniques in many-core architectures. ISLPED 2015: 25-30 - [c50]Nicolas Peltier:
Reasoning on Schemas of Formulas: An Automata-Based Approach. LATA 2015: 263-274 - 2014
- [j32]Hicham Bensaid, Nicolas Peltier:
A Complete Superposition Calculus for Primal Grammars. J. Autom. Reason. 53(4): 317-350 (2014) - [j31]Nicolas Peltier:
Tractable and intractable classes of propositional schemata. J. Log. Comput. 24(5): 1111-1139 (2014) - [c49]Sophie Tourret, Mnacho Echenim, Nicolas Peltier:
A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses. PAAR@IJCAR 2014: 94-104 - [c48]Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
A Rewriting Strategy to Generate Prime Implicates in Equational Logic. IJCAR 2014: 137-151 - [c47]Cristiano Santos, Pascal Vivet, Gene Matter, Nicolas Peltier, Sylvian Kaiser, Ricardo Augusto da Luz Reis:
Thermal modeling methodology for efficient system-level thermal analysis. CICC 2014: 1-4 - [c46]Tanguy Sassolas, Chiara Sandionigi, Alexandre Guerre, Alexandre Aminot, Pascal Vivet, Hela Boussetta, Luca Ferro, Nicolas Peltier:
Early design stage thermal evaluation and mitigation: The locomotiv architectural case. DATE 2014: 1-2 - [p1]Thierry Boy de la Tour, Nicolas Peltier:
Analogy in Automated Deduction: A Survey. Computational Approaches to Analogical Reasoning 2014: 103-130 - [i10]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Decidability and Undecidability Results for Propositional Schemata. CoRR abs/1401.3900 (2014) - [i9]Mnacho Echenim, Nicolas Peltier:
A Superposition Calculus for Abductive Reasoning. CoRR abs/1406.0303 (2014) - 2013
- [j30]Vincent Aravantinos, Mnacho Echenim, Nicolas Peltier:
A Resolution Calculus for First-order Schemata. Fundam. Informaticae 125(2): 101-133 (2013) - [j29]Mnacho Echenim, Nicolas Peltier:
Instantiation Schemes for Nested Theories. ACM Trans. Comput. Log. 14(2): 11:1-11:34 (2013) - [c45]Cristiano Santos, Pascal Vivet, Denis Dutoit, Philippe Garrault, Nicolas Peltier, Ricardo Reis:
System-level thermal modeling for 3D circuits: Characterization with a 65nm memory-on-logic circuit. 3DIC 2013: 1-6 - [c44]Abdelkader Kersani, Nicolas Peltier:
Completeness and Decidability Results for First-Order Clauses with Indices. CADE 2013: 58-75 - [c43]Abdelkader Kersani, Nicolas Peltier:
Combining Superposition and Induction: A Practical Realization. FroCos 2013: 7-22 - [c42]Mnacho Echenim, Nicolas Peltier, Sophie Tourret:
An Approach to Abductive Reasoning in Equational Logic. IJCAI 2013: 531-537 - [c41]Nicolas Peltier:
Schemata of Formulæ in the Theory of Arrays. TABLEAUX 2013: 234-249 - 2012
- [j28]Mnacho Echenim, Nicolas Peltier:
An Instantiation Scheme for Satisfiability Modulo Theories. J. Autom. Reason. 48(3): 293-362 (2012) - [j27]Nicolas Peltier, Viorica Sofronie-Stokkermans:
First-order theorem proving: Foreword. J. Symb. Comput. 47(9): 1009-1010 (2012) - [c40]Mnacho Echenim, Nicolas Peltier:
Reasoning on Schemata of Formulæ. AISC/MKM/Calculemus 2012: 310-325 - [c39]Mnacho Echenim, Nicolas Peltier:
A Calculus for Generating Ground Explanations. IJCAR 2012: 194-209 - [i8]Mnacho Echenim, Nicolas Peltier:
A Calculus for Generating Ground Explanations (Technical Report). CoRR abs/1201.5954 (2012) - [i7]Mnacho Echenim, Nicolas Peltier:
Reasoning on Schemata of Formulae. CoRR abs/1204.2990 (2012) - 2011
- [j26]Mnacho Echenim, Nicolas Peltier:
Modular instantiation schemes. Inf. Process. Lett. 111(20): 989-993 (2011) - [j25]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Decidability and Undecidability Results for Propositional Schemata. J. Artif. Intell. Res. 40: 599-656 (2011) - [c38]Vincent Aravantinos, Nicolas Peltier:
Schemata of SMT-Problems. TABLEAUX 2011: 27-42 - [c37]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Linear Temporal Logic and Propositional Schemata, Back and Forth. TIME 2011: 80-87 - [i6]Vincent Aravantinos, Nicolas Peltier:
Generating Schemata of Resolution Proofs. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 16-30 - [i5]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version). CoRR abs/1102.2174 (2011) - [i4]Vincent Aravantinos, Nicolas Peltier:
Generating Schemata of Resolution Proofs. CoRR abs/1106.2692 (2011) - [i3]Mnacho Echenim, Nicolas Peltier:
Instantiation Schemes for Nested Theories. CoRR abs/1107.4937 (2011) - 2010
- [j24]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Simplified handling of iterated term schemata. Ann. Math. Artif. Intell. 58(3-4): 155-183 (2010) - [j23]Nicolas Peltier:
Bottom-up Construction of Semantic Tableaux. J. Log. Comput. 20(1): 283-308 (2010) - [c36]Hicham Bensaid, Ricardo Caferra, Nicolas Peltier:
I-Terms in Ordered Resolution and Superposition Calculi: Retrieving Lost Completeness. AISC/MKM/Calculemus 2010: 19-33 - [c35]Mnacho Echenim, Nicolas Peltier:
Instantiation of SMT Problems Modulo Integers. AISC/MKM/Calculemus 2010: 49-63 - [c34]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
A Decidable Class of Nested Iterated Schemata. IJCAR 2010: 293-308 - [c33]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
RegSTAB: A SAT Solver for Propositional Schemata. IJCAR 2010: 309-315 - [c32]Hicham Bensaid, Ricardo Caferra, Nicolas Peltier:
Perfect Discrimination Graphs: Indexing Terms with Integer Exponents. IJCAR 2010: 369-383 - [c31]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Complexity of the Satisfiability Problem for a Class of Propositional Schemata. LATA 2010: 58-69 - [e1]Nicolas Peltier, Viorica Sofronie-Stokkermans:
Proceedings of the 7th International Workshop on First-Order Theorem Proving, FTP 2009, Oslo, Norway, July 6-7, 2009. CEUR Workshop Proceedings 556, CEUR-WS.org 2010 [contents] - [i2]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
A Decidable Class of Nested Iterated Schemata (extended version). CoRR abs/1001.4251 (2010) - [i1]Mnacho Echenim, Nicolas Peltier:
Instantiation of SMT problems modulo Integers. CoRR abs/1006.2921 (2010)
2000 – 2009
- 2009
- [j22]Nicolas Peltier:
Constructing infinite models represented by tree automata. Ann. Math. Artif. Intell. 56(1): 65-85 (2009) - [c30]Hicham Bensaid, Ricardo Caferra, Nicolas Peltier:
Dei: A Theorem Prover for Terms with Integer Exponents. CADE 2009: 146-150 - [c29]Nicolas Peltier, Viorica Sofronie-Stokkermans:
Preface. FTP 2009 - [c28]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
A Schemata Calculus for Propositional Logic. TABLEAUX 2009: 32-46 - 2008
- [j21]Nicolas Peltier:
Extended resolution simulates binary decision diagrams. Discret. Appl. Math. 156(6): 825-837 (2008) - [j20]Ricardo Caferra, Nicolas Peltier:
Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. Int. J. Intell. Syst. 23(10): 999-1020 (2008) - [c27]Nicolas Peltier:
Automated Model Building: From Finite to Infinite Models. AISC/MKM/Calculemus 2008: 155-169 - [c26]Nicolas Peltier:
A Unified View of Tree Automata and Term Schematisations. IFIP TCS 2008: 491-505 - [c25]Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
More Flexible Term Schematisations via Extended Primal Grammars. ISAIM 2008 - [c24]Rachid Echahed, Nicolas Peltier:
A Needed Rewriting Strategy for Data-Structures with Pointers. RTA 2008: 63-78 - 2007
- [j19]Nicolas Peltier:
A Resolution Calculus with Shared Literals. Fundam. Informaticae 76(4): 449-480 (2007) - [c23]Rachid Echahed, Nicolas Peltier:
Non Strict Confluent Rewrite Systems for Data-Structures with Pointers. RTA 2007: 137-152 - [c22]Nicolas Peltier:
A Bottom-Up Approach to Clausal Tableaux. TABLEAUX 2007: 199-215 - [c21]Hicham Bensaid, Ricardo Caferra, Nicolas Peltier:
Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps. WoLLIC 2007: 38-52 - 2006
- [c20]Rachid Echahed, Nicolas Peltier:
Narrowing Data-Structures with Pointers. ICGT 2006: 92-106 - [c19]Ricardo Caferra, Rachid Echahed, Nicolas Peltier:
Rewriting term-graphs with priority. PPDP 2006: 109-120 - 2005
- [j18]Nicolas Peltier:
A Resolution Calculus for Shortening Proofs. Log. J. IGPL 13(3): 307-333 (2005) - [j17]Nicolas Peltier:
Some Techniques for Proving Termination of the Hyperresolution Calculus. J. Autom. Reason. 35(4): 391-427 (2005) - 2004
- [j16]Nicolas Peltier:
Representing and Building Models for Decidable Subclasses of Equational Clausal Logic. J. Autom. Reason. 33(2): 133-170 (2004) - [j15]Nicolas Peltier:
A Proof Procedure for Functional First Order Logic Programs with Non-Deterministic Lazy Functions and Built-in Predicates. J. Funct. Log. Program. 2004 (2004) - [j14]Nicolas Peltier:
The first order theory of primal grammars is decidable. Theor. Comput. Sci. 323(1-3): 267-320 (2004) - [c18]Nicolas Peltier:
Some Techniques for Branch-Saturation in Free-Variable Tableaux. JELIA 2004: 539-551 - 2003
- [j13]Nicolas Peltier:
Constructing Decision Procedures in Equational Clausal Logic. Fundam. Informaticae 54(1): 17-65 (2003) - [j12]Nicolas Peltier:
Extracting models from clause sets saturated under semantic refinements of the resolution rule. Inf. Comput. 181(2): 99-130 (2003) - [j11]Nicolas Peltier:
Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae. Log. J. IGPL 11(1): 97-129 (2003) - [j10]Nicolas Peltier:
Model building with ordered resolution: extracting models from saturated clause sets. J. Symb. Comput. 36(1-2): 5-48 (2003) - [j9]Nicolas Peltier:
A calculus combining resolution and enumeration for building finite models. J. Symb. Comput. 36(1-2): 49-77 (2003) - [c17]Nicolas Peltier:
A More Efficient Tableaux Procedure for Simultaneous Search for Refutations and Finite Models. TABLEAUX 2003: 181-195 - [c16]Nicolas Peltier:
A Resolution-based Model Building Algorithm for a Fragment of OCC1N=. FTP 2003: 91-104 - 2001
- [j8]Nicolas Peltier:
On the decidability of the PVD class with equality. Log. J. IGPL 9(4): 569-592 (2001) - [c15]Nicolas Peltier:
A General Method for Using Schematizations in Automated Deduction. IJCAR 2001: 578-592 - 2000
- [j7]Ricardo Caferra, Nicolas Peltier:
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models. J. Symb. Comput. 29(2): 177-211 (2000) - [c14]Ricardo Caferra, Nicolas Peltier, François Puitg:
Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization. Automated Deduction in Geometry 2000: 268-305 - [c13]Ricardo Caferra, Nicolas Peltier:
The Connection Method, Constraints and Model Building. Intellectics and Computational Logic 2000: 67-84 - [c12]Peter Baumgartner, Christian G. Fermüller, Nicolas Peltier, Hantao Zhang:
Workshop: Model Computation - Principles, Algorithms, Applications. CADE 2000: 513
1990 – 1999
- 1999
- [j6]Nicolas Peltier:
Pruning the Search Space and Extracting More Models in Tableaux. Log. J. IGPL 7(2): 217-251 (1999) - 1998
- [j5]Gilles Défourneaux, Christophe Bourely, Nicolas Peltier:
Semantic Generalizations for Proving and Disproving Conjectures by Analogy. J. Autom. Reason. 20(1): 27-45 (1998) - [j4]Nicolas Peltier:
A New Method for Automated Finite Model Building Exploiting Failures and Symmetries. J. Log. Comput. 8(4): 511-543 (1998) - [c11]Nicolas Peltier:
System Description: An Equational Constraints Solver. CADE 1998: 119-123 - 1997
- [b1]Nicolas Peltier:
Nouvelles techniques pour la construction de modèles finis ou infinis en déduction automatique. (New techniques for finite or infinite model building in automated deduction). Grenoble Institute of Technology, France, 1997 - [j3]Nicolas Peltier:
Tree Automata and Automated Model Building. Fundam. Informaticae 30(1): 59-81 (1997) - [j2]Ricardo Caferra, Nicolas Peltier:
A New Technique for Verifying and Correcting Logic Programs. J. Autom. Reason. 19(3): 277-318 (1997) - [j1]Nicolas Peltier:
Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents. J. Symb. Comput. 24(1): 59-101 (1997) - [c10]Gilles Défourneaux, Nicolas Peltier:
Partial Matching for Analogy Discovery in Proofs and Counter-Examples. CADE 1997: 431-445 - [c9]Gilles Défourneaux, Nicolas Peltier:
Analogy and Abduction in Automated Deduction. IJCAI (1) 1997: 216-225 - [c8]Nicolas Peltier:
Simplifying and Generalizing Formulae in Tableaux. Pruning the Search Space and Building Models. TABLEAUX 1997: 313-327 - 1996
- [c7]Christophe Bourely, Nicolas Peltier:
DiscAtinf: A General Framework for Implementing Calculi and Strategies. DISCO 1996: 34-45 - [c6]Ricardo Caferra, Nicolas Peltier:
A Significant Extension of Logic Programming by Adapting Model Building Rules. ELP 1996: 51-65 - [c5]Christophe Bourely, Gilles Défourneaux, Nicolas Peltier:
Building Proofs or Counterexamples by Analogy in a Resoluton Framework. JELIA 1996: 34-49 - 1995
- [c4]Ricardo Caferra, Nicolas Peltier:
Decision Procedures Using Model Building Techniques. CSL 1995: 130-144 - [c3]Ricardo Caferra, Nicolas Peltier:
Extending Semantic Resolution via Automated Model Building: Applications. IJCAI 1995: 328-334 - [c2]Ricardo Caferra, Nicolas Peltier:
Model Building and Interactive Theory Discovery. TABLEAUX 1995: 154-168 - 1994
- [c1]Christophe Bourely, Ricardo Caferra, Nicolas Peltier:
A Method for Building Models Automatically. Experiments with an Extension of OTTER. CADE 1994: 72-86
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-08-23 18:32 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:
