Nicolas Peltier  Home/Search
Context Related
| leibniz.imag.fr/ATIN...nicotab97.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 powerful extension of the tableau method is described. It consists in a new simplification rule allowing to prune the search space and a new way of extracting a model from a given (possibly infinite) branch. These features are combined with a former method for simultaneous search for refutations and models. The possibilities of the new method w.r.t. the original one are clearly stated. In particular it is shown that the method is able to build model for each formula having a model... (Update)
Context of citations to this paper: More
...consistent input. The terminating saturation of consistent branches in tableau like frames requires additional concepts (e.g. constraints [3, 9], or terms with exponents [8, 6] The approach described here is based on an atomic representation of interpretations. To stop their...
Cited by: More
Tableaux + Constraints - Giese, Hähnle (2003) (Correct)
A Basis for Model Computation in Free Data Types - Ahrendt (2000) (Correct)
Active bibliography (related documents): More All
1.1: Tree Automata and Automated Model Building - Peltier (1997) (Correct)
0.6: Combining inference and disinference rules with enumeration.. - Caferra, Peltier (1997) (Correct)
0.6: A New Method for Automated Finite Model Building Exploiting.. - Peltier (1998) (Correct)
Similar documents based on text: More All
0.4: Model Building with Ordered Resolution - Peltier (2000) (Correct)
0.3: An Analytic Tableaux based Characterization of Data Base.. - Bertossi, Schwind (2001) (Correct)
0.2: A Deductive Methodology to Handle Inconsistency in Databases - Bertossi, Schwind (Correct)
Related documents from co-citation: More All
6: Model generation style completeness proofs for constraint tableaux with superpos.. - Giese - 2001
3: What you always wanted to know about rigid E- unification - Degtyarev, Voronkov - 1996
3: A first-order simplification rule with constraints - Giese - 2000
BibTeX entry: (Update)
Nicolas Peltier. Simplifying and generalizing formulae in tableaux: pruning the search space and building models. In Didier Galmiche, editor, Proc. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Pont-a-Mousson, France, volume 1227 of LNCS, pages 313-327. Springer-Verlag, 1997. http://citeseer.ist.psu.edu/peltier97simplifying.html More
@inproceedings{ peltier97simplifying,
author = "Nicolas Peltier",
title = "Simplifying and generalizing formulae in tableaux: pruning the search space and building models",
booktitle = "Proc.\ International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Pont-\`{a}-Mousson, France",
volume = "1227",
publisher = "Springer-Verlag",
editor = "Didier Galmiche",
pages = "313--327",
year = "1997",
url = "citeseer.ist.psu.edu/peltier97simplifying.html" }
Citations (may not include all citations):186 Automated Theorem Proving: A Logical Basis (context) - Loveland - 1978
156 SATCHMO: A theorem prover implemented in Prolog (context) - Manthey, Bry - 1988
118 Complete axiomatizations of the algebras of finite (context) - Maher - 1988
70 Equational problems and disunification (context) - Comon, Lescanne - 1989
49 Minimal model generation with positive unit hyper-resolution.. - Bry, Yahya - 1996
48 Hyper-tableaux - Baumgartner, Furbach et al. - 1996
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
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
21 Generation and verification of finite models and counter-exa.. (context) - Winker - 1982
19 Extending resolution for model construction (context) - Caferra, Zabel - 1990
18 Decision procedures using model building techniques - Caferra, Peltier - 1996
15 Model building and interactive theory discovery - Caferra, Peltier - 1995
15 Hyperresolution and automated model building (context) - Fermuller, Leitsch - 1996
14 Extending semantic resolution via automated model building: .. - Caferra, Peltier - 1995
12 Deciding clause classes by semantic clash resolution (context) - Leitsch - 1993
10 Semantic tableaux as framework for automated theorem-proving (context) - Reeves - 1987
10 Increasing the capabilities of model building by constraint .. (context) - Peltier - 1996
9 Building models by using tableaux extended by equational pro.. - Caferra, Zabel - 1993
6 Unification et Disunification (context) - Comon - 1988
5 A significant extension of logic programming by adapting mod.. - Caferra, Peltier - 1996
4 Search for models of equational theories (context) - Zhang - 1993
3 Counter Examples in Semantic Tableaux (context) - Klingenbeck - 1996
1 Answer sets and negation as failure (context) - Kunnen - 1987
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