BibSLEIGH — Nicolas

Travelled to:

1 × Australia
1 × Brazil
1 × Canada
1 × USA
2 × Austria
2 × Italy
2 × United Kingdom
3 × France
4 × Germany

Collaborated with:

R.Caferra M.Echenim R.Echahed ∅ V.Aravantinos S.Tourret H.Bensaid A.Kersani G.Défourneaux M.P.Lettmann C.Bourely J.C.Blanchette S.Robillard Y.Sellami T.Sassolas C.Sandionigi A.Guerre A.Aminot P.Vivet H.Boussetta L.Ferro

Talks about:

generat (4) rewrit (4) structur (3) schemata (3) pointer (3) implic (3) equat (3) term (3) data (3) strategi (2)

Person: Nicolas Peltier

DBLP: Peltier:Nicolas

Contributed to:

2015

2014

2013

2012

2010

2009

2008

2007

2006

2001

1998

1997

1994

2017

2018

Wrote 23 papers:

CADE-2015-EchenimPT #equation #generative #logic #quantifier: Quantifier-Free Equational Logic and Prime Implicate Generation (ME, NP, ST), pp. 311–325.
LATA-2015-Peltier #approach #reasoning: Reasoning on Schemas of Formulas: An Automata-Based Approach (NP), pp. 263–274.
DATE-2014-SassolasSGAVBFP #architecture #design #evaluation: Early design stage thermal evaluation and mitigation: The locomotiv architectural case (TS, CS, AG, AA, PV, HB, LF, NP), pp. 1–2.
IJCAR-2014-EchenimPT #equation #logic: A Rewriting Strategy to Generate Prime Implicates in Equational Logic (ME, NP, ST), pp. 137–151.
CADE-2013-KersaniP #decidability #first-order: Completeness and Decidability Results for First-Order Clauses with Indices (AK, NP), pp. 58–75.
IJCAR-2012-EchenimP #calculus #generative: A Calculus for Generating Ground Explanations (ME, NP), pp. 194–209.
IJCAR-2010-AravantinosCP #decidability: A Decidable Class of Nested Iterated Schemata (VA, RC, NP), pp. 293–308.
IJCAR-2010-AravantinosCP10a #named #satisfiability: RegSTAB: A SAT Solver for Propositional Schemata (VA, RC, NP), pp. 309–315.
IJCAR-2010-BensaidCP #graph #integer: Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (HB, RC, NP), pp. 369–383.
LATA-2010-AravantinosCP #complexity #problem #satisfiability: Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.
CADE-2009-BensaidCP #integer #named #proving #theorem proving: Dei: A Theorem Prover for Terms with Integer Exponents (HB, RC, NP), pp. 146–150.
RTA-2008-EchahedP #pointer: A Needed Rewriting Strategy for Data-Structures with Pointers (RE, NP), pp. 63–78.
RTA-2007-EchahedP #confluence #pointer #strict #term rewriting: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.
ICGT-2006-EchahedP #pointer: Narrowing Data-Structures with Pointers (RE, NP), pp. 92–106.
PPDP-2006-CaferraEP: Rewriting term-graphs with priority (RC, RE, NP), pp. 109–120.
IJCAR-2001-Peltier #automation #deduction #using: A General Method for Using Schematizations in Automated Deduction (NP), pp. 578–592.
CADE-1998-Peltier #constraints #equation: System Description: An Equational Constraints Solver (NP), pp. 119–123.
CADE-1997-DefourneauxP #proving: Partial Matching for Analogy Discovery in Proofs and Counter-Examples (GD, NP), pp. 431–445.
CADE-1994-BourelyCP #automation #modelling: A Method for Building Models Automatically. Experiments with an Extension of OTTER (CB, RC, NP), pp. 72–86.
CADE-2017-EchenimP #formal method: The Binomial Pricing Model in Finance: A Formalization in Isabelle (ME, NP), pp. 546–562.
IJCAR-2018-BlanchettePR #data type: Superposition with Datatypes and Codatatypes (JCB, NP, SR), pp. 370–387.
IJCAR-2018-EchenimPS #framework #generative #modulo theories: A Generic Framework for Implicate Generation Modulo Theories (ME, NP, YS), pp. 279–294.
IJCAR-2018-LettmannP #calculus #proving: A Tableaux Calculus for Reducing Proof Size (MPL, NP), pp. 64–80.