André Vellino  Home/Search
Context Related
| ai.iit.nrc.ca/~and...llino_Thesis.ps.gz ncf.ca/~an386/publ...vellino.thesis.pdf 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: ai.iit.nrc.ca/~and...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the Davis-Putnam procedure. It is shown that tree resolution simulates the improved tableau procedure and that SL-resolution and the connection method are equivalent to restrictions of the improved tableau method. The theorem by Tseitin that the Davis-Putnam Procedure cannot be simulated by tree resolution ... (Update)
Context of citations to this paper: More
.... ran the tests with the Davis Putnam procedure (DP) Davis and Putnam 1960) The DP procedure DP is in essence a resolution procedure (Vellino 1989). It performs a backtracking search in the space of all truth assignments, incrementally assigning values to formulas GSAT DP vars...
.... for solving satisfiability problems is the DavisPutnam procedure [Davis and Putnam, 1960] which is in essence a resolution method [Vellino, 1989]. This algorithm incrementally builds up a truth assignment and backtracks when it determines the assignment does not satisfy the...
Cited by: More
Evaluating Optimised Decision Procedures for.. - Horrocks.. (2002) (Correct)
Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1996) (Correct)
Planning as Satisfiability - Kautz, Selman (1992) (Correct)
Similar documents (at the sentence level):
13.0%: The Relative Complexity of Analytic Tableaux and SLResolution.. - Ca Na Da (Correct)
Active bibliography (related documents): More All
0.4: Deduction Systems Based on Resolution - Norbert Eisinger, Hans Jürgen.. (1991) (Correct)
0.3: A Comparison of Mechanisms for Avoiding Repetition of.. - Geoff Sutcliffe (Correct)
0.3: Consolution as a Framework for Comparing Calculi - Peter Baumgartner, Ulrich.. (1994) (Correct)
Similar documents based on text: More All
0.2: Agents for Mobility with a Java-enabled Orbiter - Vellino (Correct)
0.2: Hard Examples for Bounded Depth Frege - Ben-Sasson (2001) (Correct)
0.1: Computing Time Intervals Logically - Andre Vellino William (Correct)
Related documents from co-citation: More All
5: Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiabil.. (context) - Franco, Paull - 1983
4: A computing procedure for quantification theory (context) - Davis, Putnam - 1960
4: On Evaluating Decision Procedures for Modal Logic - Hustadt, Schmidt - 1997
BibTeX entry: (Update)
Vellino, A. (1989). The complexity of automated reasoning. http://citeseer.ist.psu.edu/vellino89complexity.html More
@phdthesis{ vellino89complexity,
author = "A. Vellino",
title = "{The Complexity of Automated Reasoning}",
year = "1989",
url = "citeseer.ist.psu.edu/vellino89complexity.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
537 Graph Theory with Applications (context) - Bondy, Murty - 1976
534 The Complexity of Theorem Proving Procedures (context) - Cook
309 Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1981
200 Introduction to Mathematical Logic (context) - Mendelson - 1964
142 Automated Theorem Proving (context) - Bibel - 1982
127 The Relative Efficiency of Propositional Proof Systems (context) - Cook, Reckhow - 1979
124 The Art of Computer Programming Vol (context) - Knuth - 1968
121 Hard Examples for Resolution (context) - Urquhart - 1987
107 Algorithmic Graph Theory (context) - Gibbons - 1985
72 Many Hard Examples for Resolution (context) - Chvatal, Szemeredi - 1988
52 The Intractability of Resolution (context) - Haken - 1985
48 Polynomial Size Proofs of the Propositional Pigeonhole Princ.. (context) - Buss - 1987
47 the Lengths of Proofs in the Propositional Calculus (context) - Reckhow - 1975
47 the Length of Proofs in the Propositional Calculus (context) - Cook, Reckhow - 1974
42 A proof procedure using connection graphs (context) - Kowalski - 1975
20 Computers and Intractability (context) - Garey, Johnson - 1979
20 Locking: a Restriction of Resolution (context) - Boyer - 1971
9 the Complexity of the Satisfiability Problem (context) - Goldberg - 1979
7 A proof procedure with matrix reduction (context) - Prawitz - 1970
6 Refutation Graphs (context) - Shostak - 1976
5 Resolution with Merging (context) - Andrews - 1968
5 Automation of Reasoning (context) - Siekmann, Wrightson - 1983
3 A Comparative Study of Several Proof Procedures (context) - Bibel - 1983
1 Topics in the Complexity of Combinatorial Algorithms (context) - Kirkpatric - 1974
1 A Prolog Implementation of an Analytic Tableau Theorem Prove.. (context) - Vellino - 1989
1 A DNF Without Regular Shortest Consensus Path (context) - Wenqi, Xiangdong - 1985
1 First Order Logic Springer-Verlag (context) - Smullyan - 1968
1 the Complexity of Regular Resolution and the DavisPutnam Pro.. (context) - Galil - 1977
1 The Complexity of Resolution Procedures for Theorem Proving .. (context) - Galil - 1975
The graph only includes citing articles where the year of publication is known.
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