Phase transitions in artificial intelligence systems
Artificial Intelligence
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Default reasoning using classical logic
Artificial Intelligence
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
A new method for consequence finding and compilation in restricted languages
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
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
A machine program for theorem-proving
Communications of the ACM
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Nonserial Dynamic Programming
Soft Typing for Ordered Resolution
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Algorithms and heuristics for constraint satisfaction problems
Algorithms and heuristics for constraint satisfaction problems
Efficient reasoning in graphical models
Efficient reasoning in graphical models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Diagnosing tree-decomposable circuits
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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
Summarizing CSP hardness with continuous probability distributions
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Topological parameters for time-space tradeoff
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Modelling More Realistic SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
Using weighted MAX-SAT engines to solve MPE
Eighteenth national conference on Artificial intelligence
A satisfiability procedure for quantified boolean formulae
Discrete Applied Mathematics - The renesse issue on satisfiability
Making assumptions in the automated derivation
Information Sciences: an International Journal
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
AND/OR search spaces for graphical models
Artificial Intelligence
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
A logical approach to efficient Max-SAT solving
Artificial Intelligence
QuBIS: An (In)complete Solver for Quantified Boolean Formulas
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Mixed deterministic and probabilistic networks
Annals of Mathematics and Artificial Intelligence
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Refutation by randomised general resolution
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
MB-DPOP: a new memory-bounded algorithm for distributed optimization
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A comparison of time-space schemes for graphical models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Practical partition-based theorem proving for large knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Resolution in Max-SAT and its relation to local consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
A structural approach to reasoning with quantified Boolean formulas
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Hard QBF Encodings Made Easy: Dream or Reality?
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Dynamic management of heuristics for solving structured CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Approximating weighted Max-SAT problems by compensating for relaxations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Local consistency and SAT-solvers
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Hybrid processing of beliefs and constraints
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
DPvis: a tool to visualize the structure of SAT instances
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Solving difficult SAT problems by using OBDDs and greedy clique decomposition
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The paper compares two popular strategies for solving propositional satisfiability, ibacktracking search and iresolution, and analyzes the complexity of a directional resolution algorithm (DR) as a function of the “width” (iw*) of the problem"s graph. Our empirical evaluation confirms theoretical prediction, showing that on low-iw* problems DR is very efficient, greatly outperforming the backtracking-based Davis–Putnam–Logemann–Loveland procedure (DP). We also emphasize the knowledge-compilation properties of DR and extend it to a tree-clustering algorithm that facilitates query answering. Finally, we propose two hybrid algorithms that combine the advantages of both DR and DP. These algorithms use control parameters that bound the complexity of resolution and allow time/space trade-offs that can be adjusted to the problem structure and to the user"s computational resources. Empirical studies demonstrate the advantages of such hybrid schemes.