The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicolas Peltier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  42. Automated Model Building: From Finite to Infinite Models. [Citation Graph (, )][DBLP]


  43. I-Terms in Ordered Resolution and Superposition Calculi: Retrieving Lost Completeness. [Citation Graph (, )][DBLP]


  44. Instantiation of SMT Problems Modulo Integers. [Citation Graph (, )][DBLP]


  45. Dei: A Theorem Prover for Terms with Integer Exponents. [Citation Graph (, )][DBLP]


  46. Perfect Discrimination Graphs: Indexing Terms with Integer Exponents. [Citation Graph (, )][DBLP]


  47. RegSTAB: A SAT Solver for Propositional Schemata. [Citation Graph (, )][DBLP]


  48. A Decidable Class of Nested Iterated Schemata. [Citation Graph (, )][DBLP]


  49. A Unified View of Tree Automata and Term Schematisations. [Citation Graph (, )][DBLP]


  50. A Needed Rewriting Strategy for Data-Structures with Pointers. [Citation Graph (, )][DBLP]


  51. A Schemata Calculus for Propositional Logic. [Citation Graph (, )][DBLP]


  52. Complexity of the Satisfiability Problem for a Class of Propositional Schemata. [Citation Graph (, )][DBLP]


  53. Constructing infinite models represented by tree automata. [Citation Graph (, )][DBLP]


  54. A Decidable Class of Nested Iterated Schemata (extended version) [Citation Graph (, )][DBLP]


  55. Instantiation of SMT problems modulo Integers [Citation Graph (, )][DBLP]


  56. Extended resolution simulates binary decision diagrams. [Citation Graph (, )][DBLP]


Search in 0.337secs, Finished in 0.339secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002