dblp.uni-trier.dewww.uni-trier.de

Nicolas Peltier Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
48EEHicham Bensaid, Ricardo Caferra, Nicolas Peltier: Dei: A Theorem Prover for Terms with Integer Exponents. CADE 2009: 146-150
47EEVincent Aravantinos, Ricardo Caferra, Nicolas Peltier: A Schemata Calculus for Propositional Logic. TABLEAUX 2009: 32-46
2008
46EENicolas Peltier: Automated Model Building: From Finite to Infinite Models. AISC/MKM/Calculemus 2008: 155-169
45EENicolas Peltier: A Unified View of Tree Automata and Term Schematisations. IFIP TCS 2008: 491-505
44EERachid Echahed, Nicolas Peltier: A Needed Rewriting Strategy for Data-Structures with Pointers. RTA 2008: 63-78
43EENicolas Peltier: Extended resolution simulates binary decision diagrams. Discrete Applied Mathematics 156(6): 825-837 (2008)
42EERicardo Caferra, Nicolas Peltier: Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview. Int. J. Intell. Syst. 23(10): 999-1020 (2008)
2007
41EERachid Echahed, Nicolas Peltier: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers. RTA 2007: 137-152
40EENicolas Peltier: A Bottom-Up Approach to Clausal Tableaux. TABLEAUX 2007: 199-215
39EEHicham Bensaid, Ricardo Caferra, Nicolas Peltier: Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps. WoLLIC 2007: 38-52
38EENicolas Peltier: A Resolution Calculus with Shared Literals. Fundam. Inform. 76(4): 449-480 (2007)
2006
37EERachid Echahed, Nicolas Peltier: Narrowing Data-Structures with Pointers. ICGT 2006: 92-106
36EERicardo Caferra, Rachid Echahed, Nicolas Peltier: Rewriting term-graphs with priority. PPDP 2006: 109-120
2005
35EENicolas Peltier: Some Techniques for Proving Termination of the Hyperresolution Calculus. J. Autom. Reasoning 35(4): 391-427 (2005)
34EENicolas Peltier: A Resolution Calculus for Shortening Proofs. Logic Journal of the IGPL 13(3): 307-333 (2005)
2004
33EENicolas Peltier: Some Techniques for Branch-Saturation in Free-Variable Tableaux. JELIA 2004: 539-551
32EENicolas Peltier: Representing and Building Models for Decidable Subclasses of Equational Clausal Logic. J. Autom. Reasoning 33(2): 133-170 (2004)
31EENicolas Peltier: The first order theory of primal grammars is decidable. Theor. Comput. Sci. 323(1-3): 267-320 (2004)
2003
30EENicolas Peltier: A More Efficient Tableaux Procedure for Simultaneous Search for Refutations and Finite Models. TABLEAUX 2003: 181-195
29EENicolas Peltier: A Resolution-based Model Building Algorithm for a Fragment of OCC1N=. Electr. Notes Theor. Comput. Sci. 86(1): (2003)
28EENicolas Peltier: Constructing Decision Procedures in Equational Clausal Logic. Fundam. Inform. 54(1): 17-65 (2003)
27EENicolas Peltier: Extracting models from clause sets saturated under semantic refinements of the resolution rule. Inf. Comput. 181(2): 99-130 (2003)
26EENicolas Peltier: A calculus combining resolution and enumeration for building finite models. J. Symb. Comput. 36(1-2): 49-77 (2003)
25EENicolas Peltier: Model building with ordered resolution: extracting models from saturated clause sets. J. Symb. Comput. 36(1-2): 5-48 (2003)
24EENicolas Peltier: Building Infinite Models for Equational Clause Sets: Constructing Non-Ambiguous Formulae. Logic Journal of the IGPL 11(1): 97-129 (2003)
2001
23EENicolas Peltier: A General Method for Using Schematizations in Automated Deduction. IJCAR 2001: 578-592
22EENicolas Peltier: On the decidability of the PVD class with equality. Logic Journal of the IGPL 9(4): (2001)
2000
21EERicardo Caferra, Nicolas Peltier, François Puitg: Emphasizing Human Techniques in Automated Geometry Theorem Proving: A Practical Realization. Automated Deduction in Geometry 2000: 268-305
20EEPeter Baumgartner, Christian G. Fermüller, Nicolas Peltier, Hantao Zhang: Workshop: Model Computation - Principles, Algorithms, Applications. CADE 2000: 513
19 Ricardo Caferra, Nicolas Peltier: The Connection Method, Constraints and Model Building. Intellectics and Computational Logic 2000: 67-84
18 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)
1999
17EENicolas Peltier: Pruning the Search Space and Extracting More Models in Tableaux. Logic Journal of the IGPL 7(2): 217-251 (1999)
1998
16EENicolas Peltier: System Description: An Equational Constraints Solver. CADE 1998: 119-123
15 Gilles Défourneaux, Christophe Bourely, Nicolas Peltier: Semantic Generalizations for Proving and Disproving Conjectures by Analogy. J. Autom. Reasoning 20(1): 27-45 (1998)
14 Nicolas Peltier: A New Method for Automated Finite Model Building Exploiting Failures and Symmetries. J. Log. Comput. 8(4): 511-543 (1998)
1997
13EEGilles Défourneaux, Nicolas Peltier: Partial Matching for Analogy Discovery in Proofs and Counter-Examples. CADE 1997: 431-445
12 Gilles Défourneaux, Nicolas Peltier: Analogy and Abduction in Automated Deduction. IJCAI (1) 1997: 216-225
11 Nicolas Peltier: Simplifying and Generalizing Formulae in Tableaux. Pruning the Search Space and Building Models. TABLEAUX 1997: 313-327
10 Nicolas Peltier: Tree Automata and Automated Model Building. Fundam. Inform. 30(1): 59-81 (1997)
9 Ricardo Caferra, Nicolas Peltier: A New Technique for Verifying and Correcting Logic Programs. J. Autom. Reasoning 19(3): 277-318 (1997)
8 Nicolas Peltier: Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents. J. Symb. Comput. 24(1): 59-101 (1997)
1996
7EEChristophe Bourely, Nicolas Peltier: DiscAtinf: A General Framework for Implementing Calculi and Strategies. DISCO 1996: 34-45
6EERicardo Caferra, Nicolas Peltier: A Significant Extension of Logic Programming by Adapting Model Building Rules. ELP 1996: 51-65
5EEChristophe Bourely, Gilles Défourneaux, Nicolas Peltier: Building Proofs or Counterexamples by Analogy in a Resoluton Framework. JELIA 1996: 34-49
1995
4EERicardo Caferra, Nicolas Peltier: Decision Procedures Using Model Building Techniques. CSL 1995: 130-144
3 Ricardo Caferra, Nicolas Peltier: Extending Semantic Resolution via Automated Model Building: Applications. IJCAI 1995: 328-334
2 Ricardo Caferra, Nicolas Peltier: Model Building and Interactive Theory Discovery. TABLEAUX 1995: 154-168
1994
1EEChristophe Bourely, Ricardo Caferra, Nicolas Peltier: A Method for Building Models Automatically. Experiments with an Extension of OTTER. CADE 1994: 72-86

Coauthor Index

1Vincent Aravantinos [47]
2Peter Baumgartner [20]
3Hicham Bensaid [39] [48]
4Christophe Bourely [1] [5] [7] [15]
5Ricardo Caferra [1] [2] [3] [4] [6] [9] [18] [19] [21] [36] [39] [42] [47] [48]
6Gilles Défourneaux [5] [12] [13] [15]
7Rachid Echahed [36] [37] [41] [44]
8Christian G. Fermüller [20]
9François Puitg [21]
10Hantao Zhang [20]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)