Good old Davis-Putman procedure helps counting models

Journal of Artificial Intelligence Research

Volumn 10, Issue , 1999, Pages 457-477

  Birnbaum, Elazar ^a   Lozinskii, Eliezer L ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; RECURSIVE FUNCTIONS;

BAYESIAN NETWORK; COUNTING BY DAVIS-PUTNAM; COUNTING MODELS; PROPOSITIONAL FORMULAS;

ARTIFICIAL INTELLIGENCE;

EID: 0033324877     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.601     Document Type: Article

References (16)

1. Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7, 201-215.
2. Dubois, J. (1991). Counting the number of solutions for instances of satisfiability. Theoretical Computer Science, 81(1), 49-64.
3. Franco, J., & Paull, M. (1983). Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5, 77-87.
4. Goldberg, A. (1979). Average case complexity of the satisfiability problem. In Proceedings of the 4th Workshop on Automated Deduction Austin, Texas.
5. Goldberg, A., Purdom, P., & Brown, C. (1982). Average time analysis of simplified Davis-Putnam procedures. Information Processing Letters, 15(2), 72-75.
6. Grove, A., Halpern, J., & Koller, D. (1994). Random worlds and maximum entropy. Journal of Artificial Intelligence Research, 2, 33-88.
7. Iwama, K. (1989). CNF satisfiability test by counting and polynomial average time. SIAM Journal on Computing, 18(2), 385-391.
8. Linial, N., & Nisan, N. (1990). Approximate inclusion-exclusion. Combinatorica, 10(4), 349-365.
9. Lozinskii, E. (1989). Answering atomic queries in indefinite deductive databases. International Journal of Intelligent Systems, 4(4), 403-429.
10. Lozinskii, E. (1992). Counting propositional models. Information Processing Letters, 41(6), 327-332.
11. Lozinskii, E. (1995). Is there an alternative to parsimonious semantics?. Journal of Experimental and Theoretical Artificial Intelligence, 7, 361-378.
12. Luby, M., & Veličković, B. (1991). On deterministic approximation of DNF. In Proceedings of STOC'91.
13. Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proceedings of AAAI-92.
14. Roth, D. (1996). On the hardness of approximate reasoning. Artificial Intelligence, 82, 273-302.
15. Valiant, L. (1979). The complexity of computing the permanent. Theoretical Computer Science, 8, 189-201.
16. Zhang, W. (1996). Number of models and satisfiability of sets of clauses. Theoretical Computer Science, 155(1), 277-288.