Maria Ines Camarate de Campos Lynce de Faria  Home/Search
Context
Related
| sat.inesc.pt/~ines/publicat...msc.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: sat.inescid.pt/~ines/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: in Arti cial Intelligence and in other elds of Computer Science and Engineering. The ability to reduce either the number of variables or clauses in instances of SAT impacts the expected computational e ort of solving a target problem instance. In the past, it has already been shown that large simpli cations can be obtained using algebraic simpli cation techniques. On the other hand, intelligent backtrack search algorithms for SAT have empirically been shown to be highly e ective in pruning... (Update)
Similar documents (at the sentence level):
7.5%: Algebraic Simplification Techniques for Propositional.. - Marques-Silva (2000) (Correct)
Active bibliography (related documents): More All
2.1: The Puzzling Role of Simplification in Propositional.. - Lynce, Marques-Silva (2001) (Correct)
1.2: Solving Satisfiability Problems Using Elliptic.. - van Maaren, Warners (Correct)
0.7: Evolutionary Computing for the Satisfiability Problem - Hao, Lardeux, Saubion (2003) (Correct)
Similar documents based on text: More All
0.2: Concurrent Object-Oriented Programming: Separation and Composition .. - Silva (Correct)
0.2: M 'etodos Explicitos Por Ajuste De Exponencial Para Simulacao.. - Silveira (1989) (Correct)
0.2: Design And Implementation Of A Population Of Cooperative.. - Aparício (Correct)
BibTeX entry: (Update)
@misc{ faria-algebraic,
author = "Maria Ines Camarate de Campos Lynce de Faria",
title = "Algebraic Simplification Techniques For Propositional Satisfiability",
url = "citeseer.ist.psu.edu/faria01algebraic.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1992
534 The complexity of theorem proving procedures (context) - Cook - 1971
390 A machine program for theorem-proving (context) - Davis, Logemann et al. - 1962
244 Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
197 Noise strategies for improving local search - Kautz, Selman et al. - 1994
190 Using CSP look-back techniques to solve real-world SAT insta.. - Jr, Schrag - 1997
186 Automated theorem proving: A logical basis (context) - Loveland - 1978
185 Principles of Database Systems (context) - Ullman - 1982
146 Domain-independent extensions to GSAT: Solving large structu.. - Selman, Kautz - 1993
124 Boosting combinatorial search through randomization - Gomes, Selman et al. - 1998
123 A linear-time algorithm for testing the truth of certain qua.. (context) - Aspvall, Plass et al. - 1979
121 Hard examples for resolution (context) - Urquhart
97 Experimental results on the crossover point in random 3-SAT - Crawford, Auton - 1996
92 Building decision procedures for modal logics from propositi.. - Giunchiglia, Sebastiani - 1996
67 A computing procedure for quanti cation theory (context) - Davis, Putnam - 1960
55 A discrete lagrangian-based global-search method for solving.. - Shang, Wah - 1998
54 SATO: An ecient propositional prover (context) - Zhang - 1997
51 Report on a SAT competition - Buro, Kleine-B - 1992
50 Programming With Constraints : An Introduction (context) - Marriott, Stuckey - 1999
49 SAT versus UNSAT (context) - Dubois, Andre et al. - 1993
48 A rearrangement search strategy for determining propositiona.. - Zabih, McAllester - 1988
45 A logical framework for depiction and image interpretation (context) - Reiter, Mackworth - 1989
43 SEM: a system for enumerating models (context) - Zhang, Zang - 1995
39 A new method for solving hard satis ability problems (context) - Selman, Levesque et al. - 1992
39 A new method for solving hard satis ability problems (context) - Levesque, Selman et al. - 1992
38 Ten challenges in propositional reasoning and search - Kautz, Selman et al. - 1997
32 Finding dominators in directed graphs (context) - Tarjan - 1974
30 The propositional formula checker HeerHugo - Warners - 2000
26 Integrating equivalency reasoning into Davis-Putnam procedur.. - Li - 2000
22 Heuristics based on unit propagation for satis ability probl.. (context) - Li - 1997
21 Tabu search for SAT (context) - Sais, Mazure et al. - 1997
20 Implementing the Davis-Putnam method - Zhang, Stickel - 2000
19 Associative Networks: Representation and use of knowledge by.. (context) - Findler - 1979
18 Planning as satis ability (context) - Kautz, Selman - 1992
17 Resolution versus search: Two strategies for SAT - Rish, Dechter - 2000
17 Linear-time algorithms for testing the satis ability of prop.. (context) - Dowling, Gallier - 1984
17 SATLIB: An online resource for research on SAT - Stutzle - 2000
16 Reasoning in Boolean Networks (context) - Kunz, Sto - 1997
16 Superscalar processor veri cation using ecient reductions fr.. (context) - Velev, Bryant - 1999
13 The Art of Computer Programming III: Sorting and Searching (context) - Knuth - 1973
11 Look-ahead versus look-back for satis ability problems (context) - Li - 1997
11 Algorithms for the satis ability (context) - Franco, Gu et al. - 1997
10 GRASP-A search algorithm for propositional satis ability (context) - Marques-Silva, Sakallah - 1999
10 GRASP: A new search algorithm for satis ability (context) - Marques-Silva, Sakallah - 1996
8 The impact of branching heuristics in propositional satis ab.. (context) - Marques-Silva - 1999
8 Combinational equivalence checking using satis ability and r.. (context) - Marques-Silva, Glass - 1999
7 Using Walk-SAT and Rel-SAT for cryptographic key search - Massacci - 1999
7 Branching rules for satis ability (context) - Hooker, Vinay - 1995
7 Exploration and innovation in design (context) - Navinchandra - 1990
6 Solving propositional satis ability problems (context) - Jeroslow, Wang - 1990
6 DIMAC SAT instance available from URL ftpDimac (context) - Trick, DIMACS et al. - 1993
5 A system for determining propositional logic theorems by app.. (context) - St - 1989
5 An improved incremental algorithm for computing prime implic.. (context) - de Kleer - 1992
5 Improvements to Propositional Satis ability Search Algorithm.. (context) - Freeman - 1995
4 A new method for testing decision procedures in modal logics - Giunchiglia, Sebastiani - 1997
4 Finding hard instances of the satis ability problem: A surve.. (context) - Cook, Mitchell - 1997
4 Local search for channel assignment in cellular mobile netwo.. (context) - Rushforth, Wang - 1997
4 Arti cial Intelligence (context) - Russell, Norvig - 1995
4 The pure literal rule and polynomial average time (context) - Purdom, Cynthia et al. - 1985
3 Algebraic simpli cation techniques for propositional satis a.. (context) - Marques-Silva - 2000
3 Robust search algorithms for test pattern generation (context) - Marques-Silva, Sakallah - 1997
3 Satis ability testing with more reasoning and less guessing (context) - Van Gelder, Tsuji - 1996
3 Logical cryptanalysis as a SAT problem (context) - Massacci, Marraro - 2000
2 A two phase algorithm for solving a class of hard satis abil.. (context) - Warners, van Maaren - 1998
2 Satis ability in the year (context) - Gent, Walsh - 2000
2 Con ict analysis in search algorithms for propositional sati.. (context) - Marques-Silva, Sakallah - 1996
2 Improving satis ability algorithms by using recursive learni.. (context) - Marques-Silva - 1998
2 Hybrid algorithms for the constraint satisfaction problem (context) - Prosser - 1993
2 Simulated annealing for hard satis ability problems (context) - Spears - 1996
1 Boolean satis ability algorithms and applications in electro.. (context) - Marques-Silva - 2000
1 On applying algebraic simpli cation in boolean satis ability (context) - Marques-Silva - 2000
1 Neural net and boolean satis ability model of logic circuits (context) - Agrawal, Chakradhar et al. - 1990
1 On selecting problem instances for evaluating satis ability .. (context) - Marques-Silva - 2000
1 Eciency and completeness of the set of support strategy (context) - Robinson, Wos et al. - 1965
1 Eciency and stability of hypergraph sat algorithms (context) - Pretolani - 1993
1 A nn algorithm for boolean satis ability problems (context) - Spears - 1996
1 Solving satis ability with less searching (context) - Purdom - 1984
1 Depth- rst search and linear graph algoritms (context) - Tarjan - 1972
1 Usimg DNA to solve NP-complete problems (context) - Lipton - 1995
1 A proof theoretic concept of tautolocal hardness (context) - St - 1994
1 An Overview of Backtrack Search Satis ability Algorithms (context) - Marques-Silva - 1998
1 Highlights of satis ability research in the year (context) - van Maaren - 2000
1 A non-heuristic program for proving elementary logical theor.. (context) - Dunham, Fridshal et al. - 1959
1 Algorithms for the satis ability (context) - Wang - 1997
1 Cossack: A constraint-based expert system for con guration t.. (context) - Frayman, Mittal - 1987
1 Exploiting locality in a TMS (context) - de Kleer - 1990
1 A short cut for certain combinatorial problems (context) - Deutsch - 1966
1 Available from http://dream (context) - Gent, Wash et al. - 1999
1 algoritmo do jantar de anos (context) - Crato - 2000
Documents on the same site (http://sat.inesc-id.pt/~ines/index.html): More
Complete Unrestricted Backtracking Algorithms for.. - Lynce, Marques-Silva (2002) (Correct)
Towards Provably Complete Stochastic Search.. - Lynce, Baptista.. (Correct)
Efficient Data Structures for Fast SAT Solvers - Lynce, Marques-Silva (2001) (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