Structure-based satisfiability checking: Analyzing and harnessing the potential

Authors:
Matti Järvisalo
Affiliations:
(Correspd. E-mail: matti.jarvisalo@tkk.fi) Department Information and Computer Science, Helsinki University of Technology (TKK), Finland
Venue:
AI Communications
Year:
2009

Citing 8
Cited 0

Unrestricted vs restricted cut in a tableau method for Boolean circuits

Annals of Mathematics and Artificial Intelligence
The state of SAT

Discrete Applied Mathematics
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study

Journal of Algorithms
Extended asp tableaux and rule redundancy in normal logic programs1

Theory and Practice of Logic Programming
Limitations of restricted branching in clause learning

Constraints
Justification-Based Non-Clausal Local Search for SAT

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On the power of top-down branching heuristics

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note summarizes a dissertation that focuses on methods for solving structured real-world problems based on propositional satisfiability (SAT). The work contributes to the analysis and development of both complete search (DPLL and clause learning) and stochastic local search methods for SAT.