Double Horn Functions

Information and Computation

Volumn 144, Issue 2, 1998, Pages 155-190

  Eiter, Thomas ^a   Ibaraki, Toshihide ^b   Makino, Kazuhisa ^c  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

^b KYOTO UNIVERSITY   (Japan)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001743527     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2713     Document Type: Article

References (39)

1. Angluin, D., Frazier, M., and Pitt, L. (1990), Learning conjunctions of Horn clauses, in "31st Annual Symposium on Foundations of Computer Science," pp. 186-192.
2. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. (1987), Occam's razor, Inform. Process. Lett. 24, 377-380.
3. Boros, E., Ibaraki, T., and Makino, K. (1998), Error-free and best-fit extensions of partially defined Boolean functions, Inform. and Comput. 140, 254-283.
4. Ceri, S., Gottlob, G., and Tanca, L. (1990), "Logic Programming and Databases," Springer-Verlag, Berlin/New York.
5. Crama, Y., Hammer, P. L., and Ibaraki, T. (1988), Cause-effect relationships and partially defined Boolean functions, Ann. Oper. Res. 16, 299-326.
6. Dowling, D. W., and Gallier, J. H. (1984), Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Program. 3, 267-284.
7. Dechter, R., and Pearl, J. (1992), Structure identification in relational data, Artificial Intelligence 58, 237-270.
8. Eiter, T. (1995), Generating boolean μ-expressions, Acta Inform. 32, 171-187.
9. Eiter, T., Ibaraki, T., and Makino, K. (1996), Multi-Face Horn Functions, Technical Report CD-TR 96/95, Information Systems Department, Technical University of Vienna.
10. Ekin, O., Hammer, P. L., and Peled, U. N. (1997), Horn functions and submodular Boolean functions, Theoret. Comput. Sci. 175, 257-270.
11. Golumbic, M., Hammer, P. L., Hansen, P., and Ibaraki, T. (Eds.) (1990), Horn logic, search and satisfiability, Ann. Math. Artificial Intelligence 1.
12. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability," Freeman, New York.
13. Gross, O., (1962), Preferential arrangements, Amer. Math. Monthly 69, 4-8.
14. Gurvich, V. A., (1991), On repetition-free boolean functions, Uspekhi Math. Nauk 32, 183-184. [Russian]
15. Gurvich, V. A., (1991), Criteria for repetition-freeness of functions in the algebra of logic, Soviet Math. Dokl. 43, 721-726. [English translation of Dokl. Akad. Nauk SSSR, 318 (1991).]
16. Gurvich, V. A., (1991), Criteria for repetition-freeness of functions in the algebra of logic, Soviet Math. Dokl. 43, 721-726. [English translation of Dokl. Akad. Nauk SSSR, 318 (1991).]
17. Hammer, P. L., and Kogan, A. (1993), Optimal compression of propositional Horn knowledge bases: Complexity and approximation, Artificial Intelligence 64, 131-145.
18. Hammer, P. L., and Kogan, A. (1992), Horn functions and their DNFs, Inform. Process. Lett. 44, 23-29.
19. Hammer, P. L., and Kogan, A. (1995), Quasi-acyclic propositional Horn knowledge bases: Optimal compression, IEEE Trans. Knowledge Data Engrg. 7, 751-762.
20. Helmbold, D., Sloan, R., and Warmuth, M. (1990), Learning nested differences of intersection-closed concept classes, Mach. Learning 5, 165-190.
21. Horn, A. (1951), On sentences which are true of direct unions of algebras, J. Symbolic Logic 16, 14-21.
22. Hunt III, H., and Stearns, R. (1990), The complexity of very simple Boolean formulas with applications, SIAM J. Comput. 19, 44-70.
23. Johnson, D. S., Yannakakis, M., and Papadimitriou, C. H. (1988), On generating all maximal independent sets, Inform. Process. Lett. 27, 119-123.
24. Karchmer, M., Linial, N., Newman, I., Saks, M., and Wigderson, A. (1993), Combinatorial characterizaltion of read-once formulae, Discrete Math. 114, 275-282.
25. Kautz, H.. A., Kearns, M. J., and Selman, B. (1993), Reasoning with characteristic models, in "Proc. Eleventh National Conference on Artificial Intelligence," pp. 34-39.
26. Kautz, H..A., Kearns, M. J., and Selman, B. (1995), Horn approximations of empirical data, Artificial Intelligence 74, 129-145.
27. Kavvadias, D., Papadimitriou, C. H., and Sideri, M. (1996), On Horn envelopes and hypergraph transversals, in "ISAAC'93, Algorithms and Computation" (K. W. Ng et al., Eds.), Lecture Notes in Computer Science, Vol. 762, pp. 399-405, Springer-Verlag, Berlin/New York.
28. Khardon, R., (1995), Translating between Horn representations and their characteristic models, J. Artificial Intelligence Res. 3, 349-372.
29. Knuth, D. E. (1973), Sorting and Searching, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA.
30. Makino, K., Hatanaka, K., and Ibaraki, T. (1995), Horn extensions of a partially defined Boolean function, RUTCOR Research Report RRR 27-95, Rutgers University.
31. Makowsky, J. (1987), Why Horn formulas matter for computer science: initial structures and generic examples, J. Comput. System Sci. 34, 266-292.
32. McKinsey, J. C. C. (1943), The decision problem for some classes of sentences without quantifiers, J. Symbolic Logic 8, 61-76.
33. Mundici, D. (1989), Functions computed by monotone boolean formulas with no repeated variables, Theoret. Comput. Sci. 66, 113-114.
34. Pitt, L., and Valiant, L. (1988), Computational limitations on learning from examples, Assoc. Comput. Mach. 35, 965-984.
35. Quine, W. (1955), A way to simplify truth functions, Amer. Math. Monthly 62, 627-631.
36. Selman, B., and Kautz, H. (1991), Knowledge compilation using Horn approximation, in "Proc. Ninth National Conference on Artificial Intelligence," 904-909.
37. Trakhtenbrot, B. A. (1958), On the theory of repetition-free contact schemes, Trudy Mat. Inst. Steklov. 51, 226-269. [in Russian]
38. Valiant, J. G. (1984), A theory of the learnable, Comm. ACM 27, 1134-1142.
39. Wegener, I. (1987), "The Complexity of Boolean Functions," Wiley and Teubner, New York.