Algorithms for selective enumeration of prime implicants

Artificial Intelligence

Volumn 111, Issue 1, 1999, Pages 41-72

  Palopoli, Luigi ^a   Pirri, Flora ^b   Pizzuti, Clara ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INTEGER PROGRAMMING;

PRIME IMPLICANTS;

DIGITAL ARITHMETIC;

EID: 0033165019     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00035-1     Document Type: Article

References (47)

1. C. Bell, A. Nerode, R.T. Ng, V.S. Subrahmanian, Implementing deductive databases by linear programming, in: Proc. 11 th Conference on Principles of Database Systems (PODS-92), 1992, pp. 283-292.
2. C. Bell, A. Nerode, R.T. Ng, V.S. Subrahmanian, Implementing stable semantics by linear programming, in: Proc. 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning, Lisbon, Portugal, 1993, pp. 23-42.
3. C. Bell, A. Nerode, R.T. Ng, V.S. Subrahmanian, Implementing deductive databases by mixed integer programming, ACM Trans. Database Systems 21 (2) (1996) 238-269.
4. C. Blair, R. Jeroslow, J.K. Lowe, Some results and experiments in programming techniques for propositional logic, Comp. Oper. Res. 13 (1998) 633-645.
5. C. Chandra, G. Markowsky, On the number of prime implicants, Discrete Math. 24 (1978) 7-11.
6. E. Charniak, S.E. Shimony, Probabilistic semantics for cost based abduction, in: Proc. AAAI-90, Boston, MA, 1990, pp. 106-111.
7. M. Cialdea Mayer, F. Pirri, C. Pizzuti, Natural properties of abductive hypotheses in three-valued logic, in: Proc. 10th International Conference on Logic Programming, Post-Conference Workshop on Abductive Reasoning, Budapest, Hungary, 1993, pp. 42-51.
8. P.T. Cox, T. Pietrzykowski, A complete nonredundant algorithm for reversed skolemization, Theoret. Comput. Sci. 28 (1984) 239-261.
9. P.T. Cox, T. Pietrzykowski, Causes for events: Their computation and applications, in: Proc. 8th Conference on Automated Deduction (CADE-86), 1986, pp. 608-621.
10. G. Dantzig, Linear Programming and Extensions, Press, Princeton, 1963.
11. J. de Kleer, Exploiting locality in a TMS, in: Proc. AAAI-90, Boston, MA, 1990, pp. 254-271.
12. J. de Kleer, A.K. Mackworth, R. Reiter, Characterizing diagnoses, in: Proc. AAAI-90, Boston, MA, 1990, pp. 324-330.
13. J. de Kleer, An improved incremental algorithm for generating prime implicates, in: Proc. AAAI-92, San Jose, CA, 1992, pp. 780-785.
14. M. Ginzberg, A circumscriptive theorem prover, in: Proc. 2nd International Workshop on Nonmonotonic Reasoning, Lecture Notes in Computer Science, Vol. 346, Springer, Berlin, 1988, pp. 100-114.
15. J.R. Hobbs, M.E. Stickel, D.E. Appell, P. Martin, Interpretation as abduction, Artificial Intelligence 63 (2) (1993)69-142.
16. J. N. Hooker, A Quantitative approach to logical inference, Decision Support Systems 4 (1988) 45-69.
17. J.N. Hooker, C. Fedjki, Branch-and-cut solutions of inference problems in propositional logic, Ann. Math. Artificial Intelligence 1 (1990) 123-139.
18. P. Jackson, Computing prime implicants incrementally, in: Proc. 11th Conference on Automated Deduction (CADE-92), 1992, pp. 253-267.
19. P. Jackson, J. Pais, Computing prime implicants, in: Proc. 10th Conference on Automated Deduction (CADE-90), 1990, pp. 543-557.
20. R. Jeroslow, J. Wang, Solving propositional satisfiability problems, Ann. Math. Artificial Intelligence 1 (1990) 167-187.
21. G. Karnaugh, The map method for synthesis of combinational logic circuits, AIEE Trans. Commun, and Electron. 72 (1953) 593-599.
22. H. Kautz, B. Selman, Knowledge compilation and theory approximation, J. ACM 43 (2) (1996) 193-224.
23. D. Kavvadias, C. Papadimitriou, M. Sideri, On Horn envelopes and hypergraph transversal, in: Proc. ISAAC: 4th International Symposium on Algorithms and Computation, Springer, Berlin, 1993.
24. A. Kean, G. Tsiknis, An incremental method for generating prime implicants/implicates, J. Symbolic Comput. 9 (1990) 185-206.
25. J.C. Madre, O. Courdet, A logically complete maintenance system based on a logical constraint solver, in: Proc. IJCAI-91, Sydney, Australia, 1991, pp. 294-299.
26. P. Marquis, Extending abduction from propositional to first-order logic, in: Proc. 1st International Workshop on Fundamentals of Artificial Intelligence Research (FAIR-91), Lecture Notes in Artificial Intelligence, Vol. 535, Springer, Berlin, 1991, pp. 141-155.
27. D. Mitchell, B. Selman, H. Levesque, Hard and easy distribution of SAT problems, in: Proc. AAAI-92, San Jose, CA, 1992, pp. 459-465.
28. T. Ngair, A new algorithm for incremental prime implicate generation, in: Proc. IJCAI-93, Chambéry, France, 1993.
29. C. Papadimitriou, The complexity of knowledge representation, in: Proc. IEEE Conference Structures in Complexity Theory, 1996, pp. 244-248.
30. C. Pizzuti, Computing prime implicants by integer programming methods, in: Proc. ICTAI-96, Toulouse, France, 1996, pp. 332-336.
31. D. Poole, Normality and faults in logic-based diagnosis, in: Proc. IJCAI-89, Detroit, MI, 1989, pp. 1304-1310.
32. H.E. Pople Jr., On the mechanization of abductive logic, in: Proc. IJCAI-73, Stanford, CA, 1973, pp. 147-152.
33. W.V.O. Quine, On cores and prime implicants of truth functions, American Math. Monthly 66 (1959) 755-760.
34. O. Raiman, J. de Kleer, Minimality maintenance system, in: Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA, 1992, pp. 532-538.
35. A. Ramesh, N.V. Murray, Non-clausal deductive technique for computing prime implicants and prime implicate, in: Proc. Conference on Logic Programming and Automated Reasoning (LPAR-93), St. Petersburg, Russia, Lecture Notes in Artificial Intelligence, Vol. 698, Springer, Berlin, 1993, pp. 277-284.
36. A. Ramesh, N.V. Murray, Avoiding tests for subsumption, Proc. AAAI-94, Seatle, WA, 1994, pp. 175-180.
37. R. Reiter, A theory of diagnosis from first principles, Artificial Intelligence 32 (1987) 57-96.
38. R. Reiter, J. de Kleer, Foundations of assumption-based truth maintenance systems: Preliminary report, in: Proc. AAAI-87, Seattle, WA, 1987, pp. 183-188.
39. R. Reiter, Knowledge in action, http://www.cs.utoronto.ca/cogrob.
40. R. Rymon, On kernel rules and prime implicants, in: Proc. AAAI-90, Boston, MA, 1994, pp. 181-186.
41. E. Santos, A linear constraint satisfaction approach to cost-based abduction, Artificial Intelligence 65 (1994) 1-27.
42. R. Schrag, J.M. Crawford, Implicates and prime implicates in random 3SAT, Artificial Intelligence 81 (1996) 199-222.
43. B. Selman, H.J. Levesque, Abductive and default reasoning: a computational core, in: Proc. AAAI-90, Boston, MA, 1990, pp. 343-348.
44. J.R. Slagle, C.L. Chang, R.C.T. Lee, A New algorithm for generating prime implicants, IEEE Trans. Comput. 4(1970)304-310.
45. R. Socher, Optimizing the clausal normal form transformation, J. Automat. Reason. 7 (1991) 325-336.
46. T. Strzemecki, Polynomial time algorithms for generation of prime implicants, J. Complexity 8 (1992) 37-63.
47. H.P. Williams, S.C. Brailsford, Computational logic and integer programming, in: J.E. Beasley (Ed.), Advances in Linear and Integer Programming, Oxford Univ. Press, Oxford, 1996, pp. 249-281.