246 Hits in 4.1 sec

Page 7529 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
Pruning the search space and building models.  ...  It consists in a new simplification rule allowing us to prune the search space and a new way of extracting a model from a given (possibly infinite) branch.  ... 

Simplifying and generalizing formulae in tableaux. Pruning the search space and building models [chapter]

Nicolas Peltier
1997 Lecture Notes in Computer Science  
It consists in a new simpli cation rule allowing to prune the search space and a new way of extracting a model from a given (possibly in nite) 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.  ...  We have presented a powerful extension of a tableaux-based model building method. This extension consists in a new method for extracting a model of a given branch, based on generalization techniques.  ... 
doi:10.1007/bfb0027423 fatcat:m4urfnlk7jabhpctufl32ggp7i

Page 3130 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
{For the entire collection see MR 99m:03005.} Nauka’, 2000e:03029 03B35 68T15 Peltier, Nicolas (F-IMAG-LZ; Grenoble) Pruning the search space and extracting more models in tableaux.  ...  strategies based on the use of interpretations) that prune the search space, and a new way of extracting a model from a given (possibly infi- nite) branch.  ... 

An Experimental Comparison of Theorem Provers for CTL

Rajeev Gore, Jimmy Thomson, Florian Widmann
2011 2011 Eighteenth International Symposium on Temporal Representation and Reasoning  
In the process, we gather and analyse a set of test formulae which could form the basis of a suite of benchmark formulae for CTL.  ...  We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on treetableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from the  ...  ACKNOWLEDGEMENT We thank Stefano Tonetta and Viktor Schuppan for helpful comments about model checking.  ... 
doi:10.1109/time.2011.16 dblp:conf/time/GoreTW11 fatcat:7k7sy2dlrbesvmkcgyu46helpm

A Taxonomy of Theorem-Proving Strategies [chapter]

Maria Paola Bonacina
1999 Lecture Notes in Computer Science  
For each class, the form of derivation is specified, and it is shown how inference system and search plan cooperate to generate it.  ...  in practice.  ...  Remarks and further reading A model of the search space of resolution as a search graph was given by Kowalski in [81] .  ... 
doi:10.1007/3-540-48317-9_3 fatcat:kax5uhmf5ne2zeyzbu4g4ykxbu

Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Maria Paola Bonacina
2005 Journal of symbolic computation  
This paper advances the design of a unified model for the representation of search in firstorder clausal theorem-proving, by extending to tableau-based subgoal-reduction strategies (e.g., model-elimination  ...  We conclude with a discussion comparing the marked search-graphs for tableaux, linear resolution, and ordering-based strategies, showing how this search model applies across these classes of strategies  ...  In addition to support from the Department, College, and University, the author acknowledges support from the National Science Foundation with grants CCR-94-08667, CCR-97-01508, and EIA-97-29807, and from  ... 
doi:10.1016/j.jsc.2004.11.001 fatcat:dszqocun3ncc3oxfgy64i7eahm

Minimal model generation with positive unit hyper-resolution tableaux [chapter]

François Bry, Adnan Yahya
1996 Lecture Notes in Computer Science  
Minimal Herbrand models of sets of rst-order clauses are use-  ...  Acknowledgments The authors thank Norbert Eisinger, Tim Geisler, Heribert Sch utz, and the anonymous referees for useful suggestions.  ...  The support of Alexander-von-Humboldt-Stiftung is appreciated.  ... 
doi:10.1007/3-540-61208-4_10 fatcat:7pzmrkwhy5gyvacoieq3brs32a

Incremental Closure of Free Variable Tableaux [chapter]

Martin Giese
2001 Lecture Notes in Computer Science  
Incremental Closure is a way of organizing the search for closing instantiations that avoids this inefficiency.  ...  Most existing automated proof procedures using free variable tableaux require iterative deepening and backtracking over applied instantiations to guarantee completeness.  ...  Acknowledgments I thank Wolfgang Ahrendt, Elmar Habermalz, Reiner Hähnle and the anonymous referees for their numerous and helpful comments on drafts of this paper.  ... 
doi:10.1007/3-540-45744-5_46 fatcat:iymsbye2lfcofoe5lzlya7vlhy

Simplification Rules for Intuitionistic Propositional Tableaux

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2012 ACM Transactions on Computational Logic  
The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space.  ...  In this article we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable "simpler" one with the aim to reduce the search space  ...  to reduce the search space.  ... 
doi:10.1145/2159531.2159536 fatcat:pp7ar765djf4lde632msjixl64

HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving [article]

Cezary Kaliszyk, François Chollet, Christian Szegedy
2017 arXiv   pre-print
The results of our baseline models show the promise of applying machine learning to HOL theorem proving.  ...  We also benchmark a set of simple baseline machine learning models suited for the tasks (including logistic regression, convolutional neural networks and recurrent neural networks).  ...  ACKNOWLEDGEMENTS The first author was partly supported by the ERC starting grant 714034.  ... 
arXiv:1703.00426v1 fatcat:z266umohevb3fk4o5acpuvmd7i

Discovering denial constraints

Xu Chu, Ihab F. Ilyas, Paolo Papotti
2013 Proceedings of the VLDB Endowment  
In this paper, we tackle the challenges of discovering dependencies in a more expressive integrity constraint language, namely Denial Constraints (DCs).  ...  DCs are expressive enough to overcome the limits of previous languages and, at the same time, have enough structure to allow efficient discovery and application in several scenarios.  ...  We define G-Precision as the percentage of DCs in Σs that are implied by Σg, G-Recall as the number of DCs in Σs that are implied by Σg over the total number of golden DCs, and G-F-Measure as the harmonic  ... 
doi:10.14778/2536258.2536262 fatcat:qeb4gvrtk5ekrngw4oa3nxlxha

And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL [chapter]

Rajeev Goré
2014 Lecture Notes in Computer Science  
More specifically, I would like to present results and techniques on how to solve the satisfiability problem in these logics, with global assumptions, using the tableau method.  ...  The issues that arise are the typical tensions between computational complexity, practicality and scalability. This is joint work with  ...  A little more formally but still non-algorithmically. Given a TBox T and a formula φ, both in negation normal form, our method searches for a model which satisfies φ w.r.t.  ... 
doi:10.1007/978-3-319-08587-6_3 fatcat:csco6grp2nf2blubfbeszc2qsa

Goal-Directed Invariant Synthesis for Model Checking Modulo Theories [chapter]

Silvio Ghilardi, Silvio Ranise
2009 Lecture Notes in Computer Science  
We also discuss heuristics that allow us to derive an implementation of the technique showing remarkable speed-ups on a significant set of safety problems in parametrised systems.  ...  We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reachability analysis.  ...  More candidate invariants implies a higher probability of finding an invariant and, ultimately, to prune the search space.  ... 
doi:10.1007/978-3-642-02716-1_14 fatcat:lksl7njvnng73bfznd545fnoma

Page 4659 of Mathematical Reviews Vol. , Issue 89H [page]

1989 Mathematical Reviews  
Summary: “Dominance relations are used to prune unnecessary nodes in search graphs. However, they are problem dependent and cannot be derived by a general procedure.  ...  modal tableaux.  ... 

Controlled Use of Clausal Lemmas in Connection Tableau Calculi

2000 Journal of symbolic computation  
Proof procedures based on model elimination or the connection tableau calculus have become more and more successful in the past.  ...  of the search space.  ...  Finally, we want to mention that naturally analogously to before lemma selection mechanisms can provide a drastical pruning of the search space.  ... 
doi:10.1006/jsco.1999.0363 fatcat:enhkyrpfs5a2lpc3aqlatbsgwu
« Previous Showing results 1 — 15 out of 246 results