R. Bayardo and J. Pehoushek. Counting models using connected components. In AAAI Proceedings, 2000. 173 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Sampling Combinatorial Spaces Using Biased Random Walks - And (2003) (Correct)
....number of flips to find this solution for a 3 SAT problem. 1.16 1.18 1.2 1.22 1.24 1.26 1.28 1.3 1.32 1.34 1.36 Frequency (Normalized) Figure 2: Frequency of finding a specific soln. vs. the median number of flips to find this solution for a logistic problem. experiments. Relsat [Bayardo and Pehoushek 2000] was used to systematically generate all solutions. For the logistics planning formula, we started with logistics.d.cnf available from Satlib with over 10e10 solutions. To facilatate solution set sampling experiments, we added 52 unit clauses, constraining the instance to 1600 solutions. For the ....
R.J. Bayardo and J.D. Pehoushek. Counting models using connected components. In Proc. AAAI-00.
A Model Counting Characterization of Diagnoses - Kumar (2002) (1 citation) (Correct)
.... in DNF (disjunctive normal form) is simpler than it is for CNF (conjunctive normal form) For DNF, there is a fully polynomial randomized approximation scheme (FPRAS) to estimate the number of solutions [Karp et al. 1989] CDP and DDP are two model counting algorithms for SAT instances in CNF [Bayard and Pehoushek, 2000] . A version of RELSAT has also been used to do model counting on SAT instances in CNF. If a propositional theory is in a special form called the smooth, deterministic, decomposable, negation normal form (sd DNNF) then model counting can be made tractable and incremental [Darwiche, 2001] 7 ....
Bayard R. J. and Pehoushek J. D. Counting Models using Connected Components. Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000).
Phase Transitions of PP-Complete Satisfiability Problems - Bailey, Dalmau, Kolaitis (Correct)
....3CNF formulas from the space F 3 (n; r) were carried out in [Birnbaum and Lozinskii, 1999] The main experimental finding was that the median running time of CDP reaches its peak when r 1:2. A different DPLL extension for solving #SAT, called Decomposing Davis Putnam (DDP) was presented in [Bayardo and Pehoushek, 2000] ; this procedure is based on recursively identifying connected components in the constraint graph associated with a CNFformula. Additional experiments on random 3CNF formulas from F 3 (n; r) were conducted and it was found out that the median running time of DDP reaches its peak when r 1:5. In ....
R.J. Bayardo and J.D. Pehoushek. Counting models using connected components. In 7th Nat'l Conf. on Artificial Intelligence, 2000.
Submitted to the Department of Electrical Engineering and.. - Science In Partial (Correct)
No context found.
R. Bayardo and J. Pehoushek. Counting models using connected components. In AAAI Proceedings, 2000. 173
Performing Incremental Bayesian Inference by Dynamic Model.. - Li, van Beek, Poupart (2006) (Correct)
No context found.
Bayardo, R. J., and Pehoushek, J. D. 2000. Counting models using connected components. In AAAI-00, 157--162.
Improving Exact Algorithms for MAX-2-SAT - Shen, Zhang (2003) (Correct)
No context found.
R.J. Bayardo and J.D. Pehoushek. Counting models using connected components. In 7th Nat'l Conf. on Artificial Intelligence (AAAI), pages 157--162, 2000.
Algorithms and Complexity Results for SAT and Bayesian.. - Fahiem Bacchus Shannon (2004) (Correct)
No context found.
R. J. Bayardo and J. D. Pehoushek. Counting models using connected components. In Proceedings of the AAAI National Conference (AAAI), pages 157--162, 2000.
Counting Satisfying Assignments in 2-SAT and 3-SAT - Dahllöf, Jonsson, Wahlström (Correct)
No context found.
R. J. Bayardo, Jr. and J. Pehoushek. Counting models using connected components. In Proceedings of the Seventeenth National Conference on Articial Intelligence (AAAI-2000), pages 157162. AAAI Press, 2000.
Determining the Number of Solutions to Binary CSP.. - Angelsmark, Jonsson.. (Correct)
No context found.
R. Bayardo and J. D. Pehoushek. Counting models using connected components. In Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI2000) , pages 157--162, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC