Nicolas Peltier  Home/Search
Context Related
| leibniz.imag.fr/ATIN...nicojlc97.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: leibniz.imag.fr/ATINF/...my_publi (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A method for building finite models is proposed. It combines enumeration of the set of interpretations on a finite domain with strategies in order to prune significantly the search space. The main new ideas underlying our method are to benefit from symmetries and from the information extracted from the structure of the problem and from failures of model verification tests. The algorithms formalizing the approach are given and the standard properties (termination, completeness, and soundness)... (Update)
Context of citations to this paper: More
.... finite algebra [FSB93] Among the various approaches for building models of first order formulas (e.g. CZ91,FH91,Sla92,ZZ95,FL96,BFN96,Pel98] we concentrate in this paper on the positive unit hyper resolution (PUHR) tableau method [BY96] It combines positive hyper...
...ago [15] striking results were obtained with the help of theorem provers. Most of these results concern finite mathematics [7,18,12], where finite model builders were used to show the existence or nonexistence of finite structures satisfying some properties. In this work,...
Cited by: More
Detecting Unsolvable Queries for Definite Logic Programs - Bruynooghe.. (1998) (Correct)
Two Problems in Geometry Solved by Using Automated Model Builders - Fèvre, Peltier (Correct)
Up-to-Isomorphism Enumeration of Finite Models - The Monadic Case - Thierry Boy De (Correct)
Active bibliography (related documents): More All
0.7: Can Model Builders Help Logicians in Building Infinite Models? - Peltier (Correct)
0.6: Simplifying and generalizing formulae in tableaux. Pruning the.. - Peltier (1997) (Correct)
0.6: Tree Automata and Automated Model Building - Peltier (1997) (Correct)
Similar documents based on text: More All
0.1: Increasing Model Building Capabilities by Constraint Solving on.. - Peltier (1997) (Correct)
0.1: Extending Semantic Resolution via Automated Model Building.. - Caferra, Peltier (1995) (Correct)
0.1: Using Labview In Physics Simulations For Educational Purposes - van der Meer, al. (2000) (Correct)
Related documents from co-citation: More All
5: SEM: A System for Enumerating Models (context) - Zhang, Zhang - 1995
2: A method for building models automatically (context) - BOURELY, CAFERRA et al. - 1994
2: Automatic Generation of Some Results in Finite Algebra (context) - Fujita, Slaney et al. - 1993
BibTeX entry: (Update)
Nicolas Peltier. A new method for automated finite model building exploiting failures and symmetries. Journal of Logic and Computation, 8(4):511-- 543, 1998. http://citeseer.ist.psu.edu/peltier98new.html More
@article{ peltier98new,
author = "Nicolas Peltier",
title = "A New Method for Automated Finite Model Building Exploiting Failures and Symmetries",
journal = "Journal of Logic and Computation",
volume = "8",
number = "4",
pages = "511-543",
year = "1998",
url = "citeseer.ist.psu.edu/peltier98new.html" }
Citations (may not include all citations):156 SATCHMO: A theorem prover implemented in Prolog (context) - Manthey, Bry - 1988
95 The TPTP problem library - Suttner, Sutcliffe - 1995
72 Logic for Computer Science (context) - Gallier - 1986
54 Graphes et hypergraphes (context) - Berge - 1970
51 Handbook of Mathematical Logic (context) - Barwise - 1977
50 Introduction to Mathematical Logic (context) - Church - 1956
43 SEM: a system for enumerating models (context) - Zhang, Zhang - 1995
38 scott: a model-guided theorem prover - Slaney - 1993
36 finite domain enumerator): Notes and guides (context) - Slaney - 1992
32 Automatic theorem proving with renamable and semantic resolu.. (context) - Slagle - 1967
31 A model generation theorem prover in KL1 using a ramified st.. (context) - Fujita - 1991
31 Single axioms for groups and abelian groups with various ope.. (context) - McCune - 1993
30 Using resolution for deciding solvable classes and building .. (context) - Tammet - 1991
29 A method for building models automatically (context) - Bourely, Caferra et al. - 1994
29 Resolution Methods for the Decision Problem (context) - Fermuller, Leitsch et al. - 1993
26 A method for simultaneous search for refutations and models .. - Caferra, Zabel - 1992
23 Automated reasoning contributes to mathematics and logic (context) - Wos, Winker et al. - 1990
21 Generation and verification of finite models and counter-exa.. (context) - Winker - 1982
19 Extending resolution for model construction (context) - Caferra, Zabel - 1990
15 Hyperresolution and automated model building (context) - Fermuller, Leitsch - 1996
14 Extending semantic resolution via automated model building: .. - Caferra, Peltier - 1995
14 An optimality result for clause form translation (context) - de la - 1992
12 Tractability through symmetries in propositional calculus (context) - Benhamou, Sais - 1994
8 The kernel strategy and its use for the study of combinatory.. (context) - Wos - 1993
6 the practical value of different definitional translations t.. - Egly, Rath - 1996
5 A generic graphic framework for combining inference tools an.. (context) - Caferra, Herment - 1995
5 A new technique for verifying and correcting logic programs - Caferra, Peltier - 1997
4 User-oriented theorem proving with the ATINF graphic proof e.. (context) - Caferra, Herment et al. - 1991
4 D'epartement d'Informatique (context) - Tarau - 1995
4 Search for models of equational theories (context) - Zhang - 1993
3 Problems on the generation of finite models (context) - Zhang - 1994
2 Tools for studying path and cycles in digraphs (context) - Delorme, Gu et al. - 1995
2 the complexity of extending ground resolution with symmetry .. (context) - de la, Demri - 1995
1 Ground resolution with group computations on semantic symmet.. (context) - de la - 1996
Documents on the same site (http://www-leibniz.imag.fr/ATINF/Nicolas.Peltier/my_publi.html): More
A New Technique for Verifying and Correcting Logic Programs - Caferra, Peltier (1997) (Correct)
Decision Procedures using Model Building techniques - Caferra, Peltier (1996) (Correct)
A Method for Building Models Automatically. Experiments.. - Bourely, Caferra.. (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC