Nicolas Peltier

发表

Extending Semantic Resolution via Automated Model Building: Applications

Ricardo Caferra, Nicolas Peltier, 1995, IJCAI.

A Generic Framework for Implicate Generation Modulo Theories pdf

Nicolas Peltier, Mnacho Echenim, Yanis Sellami, 2018, IJCAR.

Completeness and Decidability Results for First-Order Clauses with Indices

Nicolas Peltier, Abdelkader Kersani, N. Peltier, 2013, CADE.

A Tableaux Calculus for Reducing Proof Size pdf

Nicolas Peltier, Michael Peter Lettmann, N. Peltier, 2018, IJCAR.

Baghera Assessment Project, designing an hybrid and emergent educational society

Sylvie Pesty, Michel Occello, Jana Trgalova, 2003 .

Building Proofs or Counterexamples by Analogy in a Resoluton Framework

Nicolas Peltier, Christophe Bourely, Gilles Défourneaux, 1996, JELIA.

Dei: A Theorem Prover for Terms with Integer Exponents

Ricardo Caferra, Nicolas Peltier, Hicham Bensaid, 2009, CADE.

A Calculus for Generating Ground Explanations (Technical Report) pdf

Nicolas Peltier, Mnacho Echenim, M. Echenim, 2012, ArXiv.

Workshop: Model Computation - Principles, Algorithms, Applications

Peter Baumgartner, Christian G. Fermüller, Nicolas Peltier, 2000, CADE.

Prime Implicate Generation in Equational Logic

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2017, J. Artif. Intell. Res..

More Flexible Term Schematisations via Extended Primal Grammars

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2008, ISAIM.

On the decidability of the PVD class with equality

Nicolas Peltier, N. Peltier, 2001, Log. J. IGPL.

Thermal modeling methodology for efficient system-level thermal analysis

Nicolas Peltier, Ricardo Augusto da Luz Reis, Pascal Vivet, 2014, Proceedings of the IEEE 2014 Custom Integrated Circuits Conference.

Propositional Resolution and Prime Implicates Generation

Nicolas Peltier, 2016, Arch. Formal Proofs.

Representing and Building Models for Decidable Subclasses of Equational Clausal Logic

Nicolas Peltier, 2004, Journal of Automated Reasoning.

Extracting models from clause sets saturated under semantic refinements of the resolution rule

Nicolas Peltier, N. Peltier, 2003, Inf. Comput..

A Unified View of Tree Automata and Term Schematisations

Nicolas Peltier, 2008, IFIP TCS.

Narrowing Data-Structures with Pointers

Nicolas Peltier, Rachid Echahed, 2006, ICGT.

Superposition with Datatypes and Codatatypes

Nicolas Peltier, Simon Robillard, Jasmin Christian Blanchette, 2018, IJCAR.

Non Strict Confluent Rewrite Systems for Data-Structures with Pointers

Nicolas Peltier, Rachid Echahed, 2007, RTA.

Complexity of the Satisfiability Problem for a Class of Propositional Schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2010, LATA.

Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I

Yuzuru Tanaka, Nicolas Peltier, Randy Goebel, 2020, IJCAR.

CERES for first-order schemata pdf

Alexander Leitsch, Nicolas Peltier, Daniel Weller, 2013, J. Log. Comput..

A calculus combining resolution and enumeration for building finite models

Nicolas Peltier, 2003, J. Symb. Comput..

A Significant Extension of Logic Programming by Adapting Model Building Rules

Ricardo Caferra, Nicolas Peltier, 1996, ELP.

Analogy in Automated Deduction: A Survey

Nicolas Peltier, Thierry Boy de la Tour, N. Peltier, 2014, Computational Approaches to Analogical Reasoning.

A Proof Procedure for Functional First Order Logic Programs with Non-Deterministic Lazy Functions and Built-in Predicates

Nicolas Peltier, N. Peltier, 2004, J. Funct. Log. Program..

Linear Temporal Logic and Propositional Schemata, Back and Forth

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2011, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning.

Analogy and Abduction in Automated Deduction

Nicolas Peltier, Gilles Défourneaux, N. Peltier, 1997, IJCAI.

Instantiation of SMT problems modulo integers pdf

Nicolas Peltier, Mnacho Echenim, 2010, AISC'10/MKM'10/Calculemus'10.

First-order theorem proving: Foreword

Nicolas Peltier, Viorica Sofronie-Stokkermans, 2012, J. Symb. Comput..

Modular instantiation schemes

Nicolas Peltier, Mnacho Echenim, 2011, Inf. Process. Lett..

The Complexity of Prenex Separation Logic with One Selector pdf

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2018, ArXiv.

A New Technique for Verifying and Correcting Logic Programs

Ricardo Caferra, Nicolas Peltier, N. Peltier, 1997, Journal of Automated Reasoning.

Bottom-up Construction of Semantic Tableaux

Nicolas Peltier, N. Peltier, 2010, J. Log. Comput..

A Needed Rewriting Strategy for Data-Structures with Pointers

Nicolas Peltier, Rachid Echahed, 2008, RTA.

A Rewriting Strategy to Generate Prime Implicates in Equational Logic

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2014, IJCAR.

System-level thermal modeling for 3D circuits: Characterization with a 65nm memory-on-logic circuit

Ricardo Reis, Nicolas Peltier, Pascal Vivet, 2013, 2013 IEEE International 3D Systems Integration Conference (3DIC).

Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae

Nicolas Peltier, 2003, Log. J. IGPL.

A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules

Nicolas Peltier, N. Peltier, 2017, J. Log. Comput..

System Description: An Equational Constraints Solver

Nicolas Peltier, 1998, CADE.

Checking Entailment Between Separation Logic Symbolic Heaps: Beyond Connected and Established Systems pdf

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2020, ArXiv.

Generating Schemata of Resolution Proofs pdf

Vincent Aravantinos, Nicolas Peltier, 2011, ArXiv.

Decision Procedures Using Model Building Techniques

Ricardo Caferra, Nicolas Peltier, 1995, CSL.

Proof Generalization in LK\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {LK}$$\end{document} by Second Order

Nicolas Peltier, Thierry Boy de la Tour, N. Peltier, 2016, Journal of Automated Reasoning.

Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2020, LPAR.

Some Techniques for Proving Termination of the Hyperresolution Calculus

Nicolas Peltier, 2006, Journal of Automated Reasoning.

Model building with ordered resolution: extracting models from saturated clause sets

Nicolas Peltier, 2003, J. Symb. Comput..

On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic pdf

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2018, ArXiv.

A More Efficient Tableaux Procedure for Simultaneous Search for Refutations and Finite Models

Nicolas Peltier, N. Peltier, 2003, TABLEAUX.

The first order theory of primal grammars is decidable

Nicolas Peltier, 2004, Theor. Comput. Sci..

Some Techniques for Branch-Saturation in Free-Variable Tableaux

Nicolas Peltier, 2004, JELIA.

Rapport d'activite

Nicolas Peltier, 2005 .

A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2015, PAAR@IJCAR.

Perfect Discrimination Graphs: Indexing Terms with Integer Exponents

Ricardo Caferra, Nicolas Peltier, Hicham Bensaid, 2010, IJCAR.

The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2019, FoSSaCS.

Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II

Yuzuru Tanaka, Nicolas Peltier, Randy Goebel, 2020, IJCAR.

Early design stage thermal evaluation and mitigation: The locomotiv architectural case

Luca Ferro, Nicolas Peltier, Chiara Sandionigi, 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

A Decidable Class of Nested Iterated Schemata pdf

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2010, IJCAR.

I-terms in ordered resolution and superposition calculi: retrieving lost completeness

Ricardo Caferra, Nicolas Peltier, Hicham Bensaid, 2010, AISC'10/MKM'10/Calculemus'10.

Instantiation Schemes for Nested Theories pdf

Nicolas Peltier, Mnacho Echenim, 2013, TOCL.

Reasoning on Schemata of Formulae pdf

Nicolas Peltier, Mnacho Echenim, M. Echenim, 2012, ArXiv.

Tree Automata and Automated Model Building

Nicolas Peltier, N. Peltier, 1997, Fundam. Informaticae.

DiscAtinf: A General Framework for Implementing Calculi and Strategies

Nicolas Peltier, Christophe Bourely, N. Peltier, 1996, DISCO.

A Resolution Calculus for Propositional Schemata

Vincent Aravantinos, Nicolas Peltier, Mnacho Echenim, 2011 .

Model Building and Interactive Theory Discovery

Ricardo Caferra, Nicolas Peltier, 1995, TABLEAUX.

Automated Model Building: From Finite to Infinite Models

Nicolas Peltier, 2008, AISC/MKM/Calculemus.

A Complete Superposition Calculus for Primal Grammars

Nicolas Peltier, Hicham Bensaid, N. Peltier, 2014, Journal of Automated Reasoning.

Prenex Separation Logic with One Selector Field

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2019, TABLEAUX.

Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization

Ricardo Caferra, Nicolas Peltier, François Puitg, 2000, Automated Deduction in Geometry.

Extended resolution simulates binary decision diagrams

Nicolas Peltier, N. Peltier, 2008, Discret. Appl. Math..

Reasoning on Schemas of Formulas: An Automata-Based Approach

Nicolas Peltier, N. Peltier, 2015, LATA.

Accepting-rejecting propositions from accepted-rejected propositions: A unifying overview

Ricardo Caferra, Nicolas Peltier, N. Peltier, 2008 .

Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems pdf

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2020, ArXiv.

Schemata of Formulæ in the Theory of Arrays

Nicolas Peltier, 2013, TABLEAUX.

An Instantiation Scheme for Satisfiability Modulo Theories

Nicolas Peltier, Mnacho Echenim, 2010, Journal of Automated Reasoning.

Reasoning on Schemata of Formulæ

Nicolas Peltier, Mnacho Echenim, M. Echenim, 2012, AISC/MKM/Calculemus.

First-Order Theorem Proving: FTP 2009 Workshop Proceedings

Nicolas Peltier, Viorica Sofronie-Stokkermans, 2009 .

Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview

Ricardo Caferra, Nicolas Peltier, N. Peltier, 2008, Int. J. Intell. Syst..

The Binomial Pricing Model in Finance: A Formalization in Isabelle

Nicolas Peltier, Mnacho Echenim, M. Echenim, 2017, CADE.

A Resolution Calculus for Shortening Proofs

Nicolas Peltier, 2005, Log. J. IGPL.

Quantifier-Free Equational Logic and Prime Implicate Generation

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2015, CADE.

Simplified handling of iterated term schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2010, Annals of Mathematics and Artificial Intelligence.

Decidability and Undecidability Results for Propositional Schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2014, J. Artif. Intell. Res..

Simplifying and Generalizing Formulae in Tableaux. Pruning the Search Space and Building Models

Nicolas Peltier, N. Peltier, 1997, TABLEAUX.

Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2021, CSL.

A Schemata Calculus for Propositional Logic

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2009, TABLEAUX.

Combining Superposition and Induction: A Practical Realization

Nicolas Peltier, Abdelkader Kersani, N. Peltier, 2013, FroCos.

A General Method for Using Schematizations in Automated Deduction

Nicolas Peltier, 2001, IJCAR.

A Method for Building Models Automatically. Experiments with an Extension of OTTER

Ricardo Caferra, Nicolas Peltier, Christophe Bourely, 1994, CADE.

Tractable and intractable classes of propositional schemata

Nicolas Peltier, 2014, J. Log. Comput..

A New Method for Automated Finite Model Building Exploiting Failures and Symmetries

Nicolas Peltier, N. Peltier, 1998, J. Log. Comput..

A simulation framework for rapid prototyping and evaluation of thermal mitigation techniques in many-core architectures

Nicolas Peltier, Julien Mottin, Chiara Sandionigi, 2015, 2015 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED).

Partial Matching for Analogy Discovery in Proofs and Counter-Examples

Nicolas Peltier, Gilles Défourneaux, 1997, CADE.

Pruning the Search Space and Extracting More Models in Tableaux

Nicolas Peltier, N. Peltier, 1999, Log. J. IGPL.

Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps

Ricardo Caferra, Nicolas Peltier, Hicham Bensaid, 2007, WoLLIC.

The Connection Method, Constraints and Model Building

Ricardo Caferra, Nicolas Peltier, 2000, Intellectics and Computational Logic.

Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models

Ricardo Caferra, Nicolas Peltier, 2000, J. Symb. Comput..

Constructing infinite models represented by tree automata

Nicolas Peltier, N. Peltier, 2009, Annals of Mathematics and Artificial Intelligence.

A Resolution Calculus for First-order Schemata

Vincent Aravantinos, Nicolas Peltier, Mnacho Echenim, 2013, Fundam. Informaticae.

Ilinva: Using Abduction to Generate Loop Invariants

Nicolas Peltier, Mnacho Echenim, Yanis Sellami, 2019, FroCos.

A Calculus for Generating Ground Explanations

Nicolas Peltier, Mnacho Echenim, M. Echenim, 2012, IJCAR.

The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2020, ACM Trans. Comput. Log..

A Resolution Calculus with Shared Literals

Nicolas Peltier, 2007, Fundam. Informaticae.

A Resolution-based Model Building Algorithm for a Fragment of OCC1N=

Nicolas Peltier, 2003, Electron. Notes Theor. Comput. Sci..

An Approach to Abductive Reasoning in Equational Logic

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2013, IJCAI.

Rewriting term-graphs with priority

Ricardo Caferra, Nicolas Peltier, Rachid Echahed, 2006, PPDP '06.

A Variant of the Superposition Calculus

Nicolas Peltier, N. Peltier, 2016, Arch. Formal Proofs.

RegSTAB: A SAT Solver for Propositional Schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2010, IJCAR.

A Superposition Calculus for Abductive Reasoning

Nicolas Peltier, Mnacho Echenim, 2015, Journal of Automated Reasoning.

Schemata of SMT-Problems

Vincent Aravantinos, Nicolas Peltier, 2011, TABLEAUX.

Prime Implicate Generation in Equational Logic (extended abstract)

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2018, IJCAI.

A DPLL Proof Procedure for Propositional Iterated Schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2009 .

Semantic Generalizations for Proving and Disproving Conjectures by Analogy

Nicolas Peltier, Christophe Bourely, Gilles Défourneaux, 1998, Journal of Automated Reasoning.

Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents

Nicolas Peltier, 1997, J. Symb. Comput..

A Bottom-Up Approach to Clausal Tableaux

Nicolas Peltier, N. Peltier, 2007, TABLEAUX.

A Decidable Class of Nested Iterated Schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier, 2010, IJCAR.

Formalizing the Cox–Ross–Rubinstein Pricing of European Derivatives in Isabelle/HOL

Nicolas Peltier, Mnacho Echenim, Hervé Guiol, 2018, Journal of Automated Reasoning.

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)

Nicolas Peltier, N. Peltier, 1997 .

Constructing Decision Procedures in Equational Clausal Logic

Nicolas Peltier, 2003, Fundam. Informaticae.

Unifying Decidable Entailments in Separation Logic with Inductive Definitions

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2021, CADE.

A Superposition-Based Calculus for Quantum Diagrammatic Reasoning and Beyond pdf

Mehdi Mhalla, Nicolas Peltier, Rachid Echahed, 2021, ArXiv.

Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2021 .

A Superposition-Based Calculus for Diagrammatic Reasoning

Mehdi Mhalla, Nicolas Peltier, Rachid Echahed, 2021, PPDP.

A term-graph clausal logic: completeness and incompleteness results ★

Ricardo Caferra, Nicolas Peltier, Rachid Echahed, 2008 .

A Superposition-Based Approach to Abductive Reasoning in Equational Clausal Logic

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2014 .

A Superposition Strategy for Abductive Reasoning in Ground Equational Logic

Nicolas Peltier, Mnacho Echenim, Sophie Tourret, 2012 .

Two Problems in Geometry Solved by Using Automated ModelBuildersSt

Nicolas Peltier, St Ephane, F Evre, .

Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules

Nicolas Peltier, Mnacho Echenim, Radu Iosif, 2022, Inf. Process. Lett..

Instantiation of SMT problems modulo Integers (technical report)

Nicolas Peltier, Mnacho Echenim, M. Echenim, 2010 .