Many hard examples for resolution
Journal of the ACM (JACM)
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A machine program for theorem-proving
Communications of the ACM
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
DISTANCE-SAT: complexity and algorithms
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Investigating the effect of relevance and reachability constraints on SAT encodings of planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Proceedings of the 38th annual Design Automation Conference
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Encoding domain knowledge for prositional planning
Logic-based artificial intelligence
SAT and ATPG: algorithms for Boolean decision problems
Logic Synthesis and Verification
Parallel cooperative propositional theorem proving
Annals of Mathematics and Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Compiling Problem Specifications into SAT
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Simplifying Binary Propositional Theories into Connected Components Twice as Fast
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Modelling More Realistic SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Complexity Issues in the Davis and Putnam Scheme
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Dependent and Independent Variables in Propositional Satisfiability
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Optimizing the Computation of Heuristics for Answer Set Programming Systems
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Recovering and Exploiting Structural Knowledge from CNF Formulas
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
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
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem
CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Conditional Pure Literal Graphs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
AVAL: An Enumerative Method for SAT
CL '00 Proceedings of the First International Conference on Computational Logic
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Journal of Symbolic Computation
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Automated discovery of composite SAT variable-selection heuristics
Eighteenth national conference on Artificial intelligence
Eighteenth national conference on Artificial intelligence
On the Fine Structure of Large Search Spaces
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Random 3-SAT: The Plot Thickens
Constraints
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
On the limit of branching rules for hard random unsatisfiable 3-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
Annals of Mathematics and Artificial Intelligence
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
Combining linear programming and satisfiability solving for resource planning
The Knowledge Engineering Review
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
Applying integer programming to AI planning
The Knowledge Engineering Review
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Journal of Automated Reasoning
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Compiling problem specification into SAT
Artificial Intelligence - Special volume on reformulation
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
On quantified weighted MAX-SAT
Decision Support Systems
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
GASAT: a genetic local search algorithm for the satisfiability problem
Evolutionary Computation
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
B-Cubing: New Possibilities for Efficient SAT-Solving
IEEE Transactions on Computers
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Tools for modeling and solving search problems
AI Communications
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
Annals of Mathematics and Artificial Intelligence
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
A logical approach to efficient Max-SAT solving
Artificial Intelligence
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
A generative power-law search tree model
Computers and Operations Research
Present and Future of Practical SAT Solving
Complexity of Constraints
Compiling finite linear CSP into SAT
Constraints
Backdoors to Combinatorial Optimization: Feasibility and Optimality
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
How Hard is a Commercial Puzzle: the Eternity II Challenge
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Backdoors in the Context of Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Hiding satisfying assignments: two are better than one
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Deconstructing planning as satisfiability
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Hiding satisfying assignments: two are better than one
Journal of Artificial Intelligence Research
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
The LPSAT engine & its application to resource planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Unifying SAT-based and graph-based planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Reachability, relevance, resolution and the planning as satisfiability approach
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Improvements to the evaluation of quantified boolean formulae
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Balance and filtering in structured satisfiable problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Experimenting with heuristics for answer set programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework
Genetic Programming and Evolvable Machines
On Modern Clause-Learning Satisfiability Solvers
Journal of Automated Reasoning
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
Hierarchical BOA solves ising spin glasses and MAXSAT
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Evolutionary computing for the satisfiability problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Effective incorporation of double look-ahead procedures
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constructive interval disjunction
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
An AIG-Based QBF-solver using SAT for preprocessing
Proceedings of the 47th Design Automation Conference
A complete multi-valued SAT solver
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Grounding FO and FO(ID) with bounds
Journal of Artificial Intelligence Research
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
On the relation between answer set and sat procedures (or, between cmodels and smodels)
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Evaluating search strategies and heuristics for efficient answer set programming
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Impact of censored sampling on the performance of restart strategies
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Automatic extraction of functional dependencies
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
sharpSAT: counting models with advanced component caching and implicit BCP
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Prolog Cafe: a prolog to java translator system
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
NP-SPEC: an executable specification language for solving all problems in NP
Computer Languages
Minimum satisfiability and its applications
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms
Fundamenta Informaticae
Planning as satisfiability: Heuristics
Artificial Intelligence
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
| Hi-index | 0.01 |
The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel combinations of unit propagation and the usual "Maximum Occurrences in clauses of Minimum Size" heuristics. Based on the experimental evaluations of different alternatives a new simple unit propagation based heuristic is put forward. This compares favorably with the heuristics employed in the current state-of-the-art DPL implementations (C-SAT, Tableau, POSIT).