A backbone-search heuristic for efficient solving of hard 3-SAT formulae

Authors:
Olivier Dubois;Gilles Dequen
Affiliations:
LIP6, C.N.R.S., Université Paris 6, Paris cedex 05, France;LaRIA, Université de Picardie, Jules Verne, C.U.R.I., Amiens, France
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Year:
2001

Citing 8
Cited 42

Length of prime implicants and number of solutions of random CNF formulae

Theoretical Computer Science
A constraint-based approach to narrow search trees for satisfiability

Information Processing Letters
A machine program for theorem-proving

Communications of the ACM
The scaling window of the 2-SAT transition

Random Structures & Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Ten challenges in propositional reasoning and search

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Dependent and Independent Variables in Propositional Satisfiability

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Recovering and Exploiting Structural Knowledge from CNF Formulas

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The Quest for Efficient Boolean Satisfiability Solvers

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
On the limit of branching rules for hard random unsatisfiable 3-SAT

Discrete Applied Mathematics - The renesse issue on satisfiability
Configuration landscape analysis and backbone guided local search: part I: Satisfiability and maximum satisfiability

Artificial Intelligence
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

Annals of Mathematics and Artificial Intelligence
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers

Journal of Automated Reasoning
A two-phase backbone-based search heuristic for partial MAX-SAT: an initial investigation

IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
GASAT: a genetic local search algorithm for the satisfiability problem

Evolutionary Computation
Regular Random k-SAT: Properties of Balanced Formulas

Journal of Automated Reasoning
The state of SAT

Discrete Applied Mathematics
On look-ahead heuristics in disjunctive logic programming

Annals of Mathematics and Artificial Intelligence
Eliminating Redundant Clauses in SAT Instances

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
From High Girth Graphs to Hard Instances

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
k-SAT Is No Harder Than Decision-Unique-k-SAT

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Generation of hard non-clausal random satisfiability problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability I: background and survey of existing work

Journal of Artificial Intelligence Research
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
GUNSAT: a greedy local search algorithm for unsatisfiability

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Backbone guided local search for maximum satisfiability

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Optimal refutations for constraint satisfaction problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The backbone of the travelling salesperson

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Three truth values for the SAT and Max-SAT problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A novel local search algorithm for the traveling salesman problem that exploits backbones

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Towards industrial-like random SAT instances

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Relaxed survey propagation for the weighted maximum satisfiability problem

Journal of Artificial Intelligence Research
Evolutionary computing for the satisfiability problem

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Hierarchical hardness models for SAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
SATzilla-07: the design and analysis of an algorithm portfolio for SAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
From horn strong backdoor sets to ordered strong backdoor sets

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Approximate backbone based multilevel algorithm for next release problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation
On Computing Backbones of Propositional Theories

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A backbone-based co-evolutionary heuristic for partial MAX-SAT

EA'05 Proceedings of the 7th international conference on Artificial Evolution
Automatic extraction of functional dependencies

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
March_eq: implementing additional reasoning into an efficient look-ahead SAT solver

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A symbolic search based approach for quantified boolean formulas

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
An efficient method for solving UNSAT 3-SAT and similar instances via static decomposition

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Cube and conquer: guiding CDCL SAT solvers by lookaheads

HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Local backbones

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of how an agent creates a discrete spatial representation from its continuous interactions with the environment. Such representation will be the minimal one that explains the experiences of the agent in the environment. In this ...