Counting Models using Connected Components

Counting Models using Connected Components (2000)

Cached

Download Links

[www.almaden.ibm.com]

Other Repositories/Bibliography

DBLP

by Roberto J. Bayardo , Jr. , J. D. Pehoushek

Venue:	In AAAI
Citations:	36 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Counting Models using Connected Components	user correction - Legacy Corrections
AUTHOR NAME	Roberto J. Bayardo	user correction - Legacy Corrections
AUTHOR AFFIL	IBM Almaden Research Center	user correction - Legacy Corrections
AUTHOR NAME	Jr.	user correction - Legacy Corrections
AUTHOR NAME	J. D. Pehoushek	user correction - Legacy Corrections
ABSTRACT	Recent work by Birnbaum & Lozinskii [1999] demonstrated that a clever yet simple extension of the well-known DavisPutnam procedure for solving instances of propositional satisfiability yields an efficient scheme for counting the number of satisfying assignments (models). We present a new extension, based on recursively identifying connected constraint-graph components, that substantially improves counting performance on random 3-SAT instances as well as benchmark instances from the SATLIB and Beijing suites. In addition, from a structure-based perspective of worst-case complexity, while polynomial time satisfiability checking is known to require only a backtrack search algorithm enhanced with nogood learning, we show that polynomial time counting using backtrack search requires an additional enhancement: good learning. Introduction Many practical problems from a variety of domains, most notably planning [Kautz & Selman 1996], have been efficiently solved by formulating ...	user correction - Legacy Corrections
YEAR	2000	INFERENCE
VENUE	In AAAI	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	157--162	INFERENCE
VOLUME	2000	INFERENCE
CITATIONS	17 found	ParsCit 1.0