Generating all maximal models of a Boolean expression

Information Processing Letters

Volumn 74, Issue 3, 2000, Pages 157-162

  Kavvadias, Dimitris J ^a   Sideri, Martha ^b   Stavropoulos, Elias C ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

BOOLEAN EXPRESSION; MAXIMAL MODEL GENERATION; TRANSVERSAL HYPERGRAPH;

COMPUTATIONAL COMPLEXITY;

EID: 0033752070     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00023-5     Document Type: Article

References (20)

1. Ben-Eliyahu R., Dechter R. On computing minimal models. Ann. of Math. Artificial Intelligence. Vol. 18:1996;3-27.
2. Berge C. Hypergraphs. North-Holland Mathematical Library. Vol. 45:1989;Elsevier Science Publishers B.V, Amsterdam.
3. Cadoli M. The complexity of model checking for circumscriptive formulae. Inform. Process. Lett. Vol. 42:1992;113-118.
4. Chen Z., Toda S. The complexity of selecting maximal solutions. Inform. and Comput. Vol. 119:1995;231-239.
5. de Kleer J., Mackworth A.K., Reiter R. Characterising diagnosis and systems. Artificial Intelligence. Vol. 56:1992;197-222.
6. Eiter T., Gottlob G. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. Vol. 24:(6):1995;1278-1304.
7. Ekin O., Hammer P.L., Peled U.N. Horn functions and submodular Boolean functions. Theoret. Comput. Sci. Vol. 175:(2):1997;257-270.
8. Freidman M.L., Khachiyan L. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms. Vol. 21:1996;618-628.
9. Garcia-Molina H., Barbara D. How to assign votes in a distributed system. J. ACM. Vol. 32:(4):1985;841-860.
10. Garey M.R., Johnson D.S. Computers and Intractability - A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, New York.
11. Gunopulos D., Khardon R., Mannila H., Toinonen H. Data mining, hypergraph transversals, and machine learning. Proc. of 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ. May 12-14, 1997;209-216.
12. Gurvich V., Khachiyan L. Generating the irredundent conjunctive and disjunctive normal forms of monotone Boolean functions. Technical Report LCSR-TR-251:1995;Department of Computer Science, Rutgers University, New Brunswick, NJ.
13. Johnson D.S., Yannakakis M., Papadimitriou C.H. On generating all maximal independent sets. Inform. Process. Lett. Vol. 27:1988;119-123.
14. Kavvadias D., Papadimitriou C.H., Sideri M. On Horn envelopes and hypergraph transversals. Proc. 4th Annual International Symposium on Algorithms and Computation (ISAAC'93), Hong Kong. 1993;399-405.
15. Kavvadias D., Sideri M. The inverse satisfiability problem. SIAM J. Comput. Vol. 28:(1):1999;152-163.
16. Kavvadias D., Stavropoulos E.C. Evaluation of an algorithm for the transversal hypergraph problem. Proc. 3rd Workshop on Algorithm Engineering (WAE'99). Lecture Notes in Comput. Sci. 1999;72-84 Springer, Berlin.
17. Papadimitriou C.H. NP-completeness: A retrospective. Proc. of ICALP 98, Bologna, Italy. 1998.
18. Przymusinski T.C. An algorithm to compute circumscription. Artificial Intelligence. Vol. 38:1989;49-73.
19. Schaefer T.J. The complexity of satisfiability problems. Proc. 10th Annual ACM Symposium on Theory of Computing, San Diego, CA. 1978;216-226.
20. Selman B., Kautz H.K. Model preference default theories. Artificial Intelligence. Vol. 45:1990;287-322.