×

zbMATH — the first resource for mathematics

Peltier, Nicolas

Compute Distance To:
Author ID: peltier.nicolas Recent zbMATH articles by "Peltier, Nicolas"
Published as: Peltier, Nicolas; Peltier, N.; Peltier, Nicholas
Documents Indexed: 83 Publications since 1994, including 1 Book

Publications by Year

Citations contained in zbMATH Open

35 Publications have been cited 92 times in 57 Documents Cited by Year
Automated model building. Zbl 1085.03009
Caferra, Ricardo; Leitsch, Alexander; Peltier, Nicholas
14
2004
Increasing model building capabilities by constraint solving on terms with integer exponents. Zbl 0945.03012
Peltier, Nicolas
6
1997
A new method for automated finite model building exploiting failures and symmetries. Zbl 0904.68155
Peltier, Nicolas
4
1998
Tree automata and automated model building. Zbl 0882.68094
Peltier, Nicolas
4
1997
Semantic generalizations for proving and disproving conjectures by analogy. Zbl 0893.68134
Défourneaux, Gilles; Bourely, Christophe; Peltier, Nicolas
4
1998
Combining superposition and induction: a practical realization. Zbl 1398.68483
Kersani, Abdelkader; Peltier, Nicolas
4
2013
Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. Zbl 1149.68417
Caferra, Ricardo; Peltier, Nicolas
4
2008
A resolution calculus for first-order schemata. Zbl 1319.03033
Aravantinos, Vincent; Echenim, Mnacho; Peltier, Nicolas
3
2013
Pruning the search space and extracting more models in tableaux. Zbl 0949.03013
Peltier, Nicolas
3
1999
Combining enumeration and deductive techniques in order to increase the class of constructible infinite models. Zbl 0965.03012
Caferra, Ricardo; Peltier, Nicolas
3
2000
A schemata calculus for propositional logic. Zbl 1260.03011
Aravantinos, Vincent; Caferra, Ricardo; Peltier, Nicolas
3
2009
A calculus combining resolution and enumeration for building finite models. Zbl 1019.03009
Peltier, Nicolas
3
2003
A general method for using schematizations in automated deduction. Zbl 0988.03015
Peltier, Nicolas
3
2001
An instantiation scheme for satisfiability modulo theories. Zbl 1430.68401
Echenim, Mnacho; Peltier, Nicolas
3
2012
A new technique for verifying and correcting logic programs. Zbl 0884.68033
Caferra, Ricardo; Peltier, Nicolas
2
1997
On the decidability of the PVD class with equality. Zbl 0980.03012
Peltier, Nicolas
2
2001
Narrowing data-structures with pointers. Zbl 1156.68426
Echahed, Rachid; Peltier, Nicolas
2
2006
Model building with ordered resolution: Extracting models from saturated clause sets. Zbl 1019.03008
Peltier, Nicolas
2
2003
Constructing decision procedures in equational clausal logic. Zbl 1031.03017
Peltier, Nicolas
2
2003
The first order theory of primal grammars is decidable. Zbl 1078.68066
Peltier, Nicolas
2
2004
A calculus for generating ground explanations. Zbl 1358.68189
Echenim, Mnacho; Peltier, Nicolas
2
2012
A decidable class of nested iterated schemata. Zbl 1291.03014
Aravantinos, Vincent; Caferra, Ricardo; Peltier, Nicolas
2
2010
Perfect discrimination graphs: indexing terms with integer exponents. Zbl 1291.68324
Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas
2
2010
Decidability and undecidability results for propositional schemata. Zbl 1220.68087
Aravantinos, V.; Caferra, R.; Peltier, N.
2
2011
A resolution-based model building algorithm for a fragment of \(\mathcal{OCC}1\mathcal{N}_{=}\) (extended abstract). Zbl 1261.68105
Peltier, Nicolas
1
2003
Completeness and decidability results for first-order clauses with indices. Zbl 1381.03019
Kersani, Abdelkader; Peltier, Nicolas
1
2013
A rewriting strategy to generate prime implicates in equational logic. Zbl 1423.68412
Echenim, Mnacho; Peltier, Nicolas; Tourret, Sophie
1
2014
Representing and building models for decidable subclasses of equational clausal logic. Zbl 1105.03017
Peltier, N.
1
2004
Towards systematic analysis of theorem provers search spaces: First steps. Zbl 1213.68566
Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas
1
2007
Automated model building: From finite to infinite models. Zbl 1166.68352
Peltier, Nicolas
1
2008
Non strict confluent rewrite systems for data-structures with pointers. Zbl 1203.68072
Echahed, Rachid; Peltier, Nicolas
1
2007
Emphasizing human techniques in automated geometry theorem proving: A practical realization. Zbl 0985.68058
Caferra, Ricardo; Peltier, Nicolas; Puitg, François
1
2001
\(I\)-terms in ordered resolution and superposition calculi: retrieving lost completeness. Zbl 1286.68390
Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas
1
2010
Instantiation of SMT problems modulo integers. Zbl 1286.68397
Echenim, Mnacho; Peltier, Nicolas
1
2010
Building infinite models for equational clause sets: Constructing non-ambiguous formulae. Zbl 1017.03004
Peltier, Nicolas
1
2003
A rewriting strategy to generate prime implicates in equational logic. Zbl 1423.68412
Echenim, Mnacho; Peltier, Nicolas; Tourret, Sophie
1
2014
Combining superposition and induction: a practical realization. Zbl 1398.68483
Kersani, Abdelkader; Peltier, Nicolas
4
2013
A resolution calculus for first-order schemata. Zbl 1319.03033
Aravantinos, Vincent; Echenim, Mnacho; Peltier, Nicolas
3
2013
Completeness and decidability results for first-order clauses with indices. Zbl 1381.03019
Kersani, Abdelkader; Peltier, Nicolas
1
2013
An instantiation scheme for satisfiability modulo theories. Zbl 1430.68401
Echenim, Mnacho; Peltier, Nicolas
3
2012
A calculus for generating ground explanations. Zbl 1358.68189
Echenim, Mnacho; Peltier, Nicolas
2
2012
Decidability and undecidability results for propositional schemata. Zbl 1220.68087
Aravantinos, V.; Caferra, R.; Peltier, N.
2
2011
A decidable class of nested iterated schemata. Zbl 1291.03014
Aravantinos, Vincent; Caferra, Ricardo; Peltier, Nicolas
2
2010
Perfect discrimination graphs: indexing terms with integer exponents. Zbl 1291.68324
Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas
2
2010
\(I\)-terms in ordered resolution and superposition calculi: retrieving lost completeness. Zbl 1286.68390
Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas
1
2010
Instantiation of SMT problems modulo integers. Zbl 1286.68397
Echenim, Mnacho; Peltier, Nicolas
1
2010
A schemata calculus for propositional logic. Zbl 1260.03011
Aravantinos, Vincent; Caferra, Ricardo; Peltier, Nicolas
3
2009
Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. Zbl 1149.68417
Caferra, Ricardo; Peltier, Nicolas
4
2008
Automated model building: From finite to infinite models. Zbl 1166.68352
Peltier, Nicolas
1
2008
Towards systematic analysis of theorem provers search spaces: First steps. Zbl 1213.68566
Bensaid, Hicham; Caferra, Ricardo; Peltier, Nicolas
1
2007
Non strict confluent rewrite systems for data-structures with pointers. Zbl 1203.68072
Echahed, Rachid; Peltier, Nicolas
1
2007
Narrowing data-structures with pointers. Zbl 1156.68426
Echahed, Rachid; Peltier, Nicolas
2
2006
Automated model building. Zbl 1085.03009
Caferra, Ricardo; Leitsch, Alexander; Peltier, Nicholas
14
2004
The first order theory of primal grammars is decidable. Zbl 1078.68066
Peltier, Nicolas
2
2004
Representing and building models for decidable subclasses of equational clausal logic. Zbl 1105.03017
Peltier, N.
1
2004
A calculus combining resolution and enumeration for building finite models. Zbl 1019.03009
Peltier, Nicolas
3
2003
Model building with ordered resolution: Extracting models from saturated clause sets. Zbl 1019.03008
Peltier, Nicolas
2
2003
Constructing decision procedures in equational clausal logic. Zbl 1031.03017
Peltier, Nicolas
2
2003
A resolution-based model building algorithm for a fragment of \(\mathcal{OCC}1\mathcal{N}_{=}\) (extended abstract). Zbl 1261.68105
Peltier, Nicolas
1
2003
Building infinite models for equational clause sets: Constructing non-ambiguous formulae. Zbl 1017.03004
Peltier, Nicolas
1
2003
A general method for using schematizations in automated deduction. Zbl 0988.03015
Peltier, Nicolas
3
2001
On the decidability of the PVD class with equality. Zbl 0980.03012
Peltier, Nicolas
2
2001
Emphasizing human techniques in automated geometry theorem proving: A practical realization. Zbl 0985.68058
Caferra, Ricardo; Peltier, Nicolas; Puitg, François
1
2001
Combining enumeration and deductive techniques in order to increase the class of constructible infinite models. Zbl 0965.03012
Caferra, Ricardo; Peltier, Nicolas
3
2000
Pruning the search space and extracting more models in tableaux. Zbl 0949.03013
Peltier, Nicolas
3
1999
A new method for automated finite model building exploiting failures and symmetries. Zbl 0904.68155
Peltier, Nicolas
4
1998
Semantic generalizations for proving and disproving conjectures by analogy. Zbl 0893.68134
Défourneaux, Gilles; Bourely, Christophe; Peltier, Nicolas
4
1998
Increasing model building capabilities by constraint solving on terms with integer exponents. Zbl 0945.03012
Peltier, Nicolas
6
1997
Tree automata and automated model building. Zbl 0882.68094
Peltier, Nicolas
4
1997
A new technique for verifying and correcting logic programs. Zbl 0884.68033
Caferra, Ricardo; Peltier, Nicolas
2
1997

Citations by Year