Semantical and computational aspects of Horn approximations

Artificial Intelligence

Volumn 119, Issue 1, 2000, Pages 1-17

  Cadoli, Marco ^a   Scarcello, Francesco ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; INFERENCE ENGINES; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; SET THEORY;

HORN APPROXIMATION; HORN GREATEST LOWER BOUND; HORN LEAST UPPER BOUND; KNOWLEDGE APPROXIMATION; KNOWLEDGE COMPILATION;

COMPUTATIONAL LINGUISTICS;

EID: 0033703183     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00010-2     Document Type: Article

References (24)

1. Ben-Eliyahu R., Dechter R. On computing minimal models. Ann. Math. Artificial Intelligence. 1996;3-27.
2. Boufkhad Y. Algorithms for propositional KB approximation. Proc. AAAI-98, Madison, WI. 1998;280-285.
3. Cadoli M. On the complexity of model finding for nonmonotonic propositional logics. Marchetti Spaccamela A., Mentrasti P., Venturini Zilli M. Proc. 4th Italian Conference on Theoretical Computer Science. October 1992;125-139 World Scientific, Singapore.
4. Cadoli M. Semantical and computational aspects of Horn approximations. Proc. IJCAI-93, Chambéry, France. 1993;39-44.
5. Cadoli M., Donini F.M. A survey on knowledge compilation. AI Communications - The European Journal on Artificial Intelligence. Vol. 10:1997;137-150.
6. Chen Z., Toda S. The complexity of selecting maximal solutions. Inform. and Comput. Vol. 119:1995;231-239.
7. del Val A. An analysis of approximate knowledge compilation. Proc. IJCAI-95, Montreal, Quebec. 1995;830-836.
8. Dowling W.P., Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming. Vol. 1:1984;267-284.
9. 2 -complete. Theoret. Comput. Sci. Vol. 114:1993;231-245.
10. Eiter T., Ibaraki T., Makino K. Disjunctions of Horn theories and their cores. Proc. 9th Annual Symposium on Algorithms and Computation (ISAAC-98). 1998;49-58.
11. Gelernter H. Realization of a geometry theorem-proving machine. Proc. International Conference on Information Processing. 1959;273-282 UNESCO House, Paris.
12. Gogic G., Papadimitriou C., Sideri M. Incremental recompilation of knowledge. J. Artificial Intelligence Res. Vol. 8:1998;23-37.
13. Greiner R., Schuurmans D. Learning useful Horn approximations. Proc. Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;383-392.
14. Kautz H.A., Kearns M.J., Selman B. Horn approximations of empirical data. Artificial Intelligence. Vol. 74:1995;129-145.
15. Kautz H.A., Selman B. Forming concepts for fast inference. Proc. AAAI-92, San Jose, CA. 1992;786-793.
16. Kautz H.A., Selman B. An empirical evaluation of knowledge compilation by theory approximation. Proc. AAAI-94, Seattle, WA. 1994;155-161.
17. Kavvadias D., Papadimitriou C.H., Sideri M. On Horn envelopes and hypergraph transversals. Proc. 4th Annual Symposium on Algorithms and Computation (ISAAC-93). 1993;399-405.
18. Khardon R., Roth D. Reasoning with models. Artificial Intelligence. Vol. 87:1996;187-213.
19. Lifschitz V. Computing circumscription. Proc. IJCAI-85, Los Angeles, CA. 1985;121-127.
20. McCarthy J. Circumscription - A form of non-monotonic reasoning. Artificial Intelligence. Vol. 13:1980;27-39.
21. Papadimitriou C.H. Computational Complexity. 1994;Addison Wesley, Reading, MA.
22. Roth D. On the hardness of approximate reasoning. Proc. IJCAI-93, Chambéry, France. 1993;613-618.
23. Selman B., Kautz H.A. Knowledge compilation using Horn approximations. Proc. AAAI-91, Anaheim, CA. 1991;904-909.
24. Selman B., Kautz H.A. Knowledge compilation and theory approximation. J. ACM. Vol. 43:1996;193-224.