DPLL with a trace: From SAT to knowledge compilation

DPLL with a trace: From SAT to knowledge compilation (2005)

Cached

Download Links

by Jinbo Huang , Adnan Darwiche

Venue:	IJCAI-05
Citations:	16 - 1 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	DPLL with a trace: From SAT to knowledge compilation	user correction
AUTHOR NAME	Jinbo Huang	user correction
AUTHOR AFFIL	Computer Science Department; University of California, Los Angeles	user correction
AUTHOR ADDR	Los Angeles, CA 90095	user correction
AUTHOR NAME	Adnan Darwiche	user correction
AUTHOR AFFIL	Computer Science Department; University of California, Los Angeles	user correction
AUTHOR ADDR	Los Angeles, CA 90095	user correction
ABSTRACT	We show that the trace of an exhaustive DPLL search can be viewed as a compilation of the propositional theory. With different constraints imposed or lifted on the DPLL algorithm, this compilation will belong to the language of d-DNNF, FBDD, and OBDD, respectively. These languages are decreasingly succinct, yet increasingly tractable, supporting such polynomial-time queries as model counting and equivalence testing. Our contribution is thus twofold. First, we provide a uniform framework, supported by empirical evaluations, for compiling knowledge into various languages of interest. Second, we show that given a particular variant of DPLL, by identifying the language membership of its traces, one gains a fundamental understanding of the intrinsic complexity and computational power of the search algorithm itself. As interesting examples, we unveil the “hidden power” of several recent model counters, point to one of their potential limitations, and identify a key limitation of DPLLbased procedures in general.	user correction
YEAR	2005	user correction
VENUE	IJCAI-05	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	156--162	user correction
CITATIONS	26 found	ParsCit 1.0