Inferring minimal functional dependencies in Horn and q-Horn theories

Annals of Mathematics and Artificial Intelligence

Volumn 38, Issue 4, 2003, Pages 233-255

  Ibaraki, Toshihide ^a   Kogan, Alexander ^b,c   Makino, Kazuhisa ^d  

^a KYOTO UNIVERSITY   (Japan)

^b RUTGERS UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037262289     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023098325064     Document Type: Article

References (41)

1. W.W. Armstrong, Dependency structures of database relationships, in: Proceedings IFIP'74 (North-Holland, Amsterdam, 1974) pp. 580-583.
2. J.C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) 51-75.
3. E. Boros, Y. Crama and P.L. Hammer, Polynomial time inference of all valid implications for Horn and related formulae, Annals of Mathematics and Artificial Intelligence 1 (1990) 21-32.
4. E. Boros, Y. Crama, P.L. Hammer and M. Saks, A complexity index for satisfiability problems, SIAM Journal on Computing 23 (1994) 45-49.
5. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino, Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities, SIAM Journal on Computing 31 (2002) 1624-1643.
6. E. Boros, P.L. Hammer and X. Sun, Recognition of q-Horn formulae in linear time, Discrete Applied mathematics 55 (1994) 1-13.
7. V. Chandru, C.R. Coullard, P.L. Hammer, M. Montañez and X. Sun, On renamable Horn and generalized Horn functions, Annals of Mathematics and Artificial Intelligence 1 (1990) 33-47.
8. C.L. Chang and R.C.T. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).
9. R. Dechter and J. Pearl, Structure identification in relational data, Artificial Intelligence 58 (1992) 237-270.
10. W.F. Dowling and J.H. Gallier, Linear time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 3 (1984) 267-284.
11. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing 24 (1995) 1278-1304.
12. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, Technical Report CD-TR 91/16, Christian Doppler Labor für Expertensysteme, Technische Universität Wien, Wien, Austria (January 1991).
13. T. Eiter, G. Gottlob and K. Makino, New results on monotone dualization and generating hypergraph transversals, in: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), Montreal, Quebec, Canada, May 19-21 (2002) pp. 14-22.
14. T. Eiter and K. Makino, On computing all abductive explanations, in: Proceedings of AAAI-2002, Edmonton, Canada (2002) pp. 62-67.
15. O. Ekin, S. Foldes, P.L. Hammer and L. Hellerstein, Equational characterizations of Boolean function classes, Discrete Mathematics 211(1-3) (2000) 27-51.
16. R. Fagin, Functional dependencies in a relational database and propositional logic, IBM Journal of Research and Development 21 (1977) 534-544.
17. M.L. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms 21(3) (1996) 618-628.
18. P.L. Hammer and A. Kogan, Horn functions and their DNFs, Information Processing Letters 44 (1992) 23-29.
19. P.L. Hammer and A. Kogan, Optimal compression of propositional Horn knowledge bases: Complexity and approximation, Artificial Intelligence 64 (1993) 131-145.
20. P.L. Hammer and A. Kogan, Quasi-acyclic propositional Horn knowledge bases: Optimal compression, IEEE Transactions on Knowledge and Data Engineering 7 (1995) 751-762.
21. T. Ibaraki, A. Kogan and K. Makino, Functional dependencies in Horn theories, Artificial Intelligence 108(1-2) (1999) 1-30.
22. T. Ibaraki, A. Kogan and K. Makino, On functional dependencies in q-Horn theories, Artificial Intelligence 131(1-2) (2001) 171-187.
23. D.S. Johnson, M. Yannakakis and C.H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters 27 (1988) 119-123.
24. H. Kautz, M. Kearns and B. Selman, Horn approximations of empirical data, Artificial Intelligence 74 (1995) 129-145.
25. D. Kavvadias, C.H. Papadimitriou and M. Sideri, On Horn envelopes and hypergraph transversals, in: Algorithms and Computation - ISAAC'93, eds. K.W. Ng et al., Lecture Notes in Computer Science, Vol. 762 (Springer, Berlin, 1993) pp. 399-405.
26. R. Khardon, Translating between Horn representations and their characteristic models, Journal of Artificial Intelligence Research 3 (1995) 349-372.
27. R. Khardon and D. Roth, Reasoning with models, Artificial Intelligence 87 (1996) 187-213.
28. J. Kivinen and H. Mannila, Approximate inference of functional dependencies from relations, Theoretical Computer Science 149 (1995) 129-149.
29. E. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM Journal on Computing 9 (1980) 558-565.
30. H.R. Lewis, Renaming a set of clauses as a Horn set, Journal of the ACM 25 (1978) 134-135.
31. D. Maier, The Theory of Relational Databases (Computer Science Press, Rockville, MD, 1983).
32. K. Makino and T. Ibaraki, The maximum latency and identification of positive Boolean functions, SIAM Journal on Computing 26 (1997) 1363-1383.
33. H. Mannila and K.-J. Räihä, Design of Relational Databases (Addison-Wesley, Wokingham, 1992).
34. H. Mannila and K.-J. Räihä, On the complexity of inferring functional dependencies, Discrete Applied Mathematics 40 (1992) 237-243.
35. H. Mannila and K.-J. Räihä, Algorithms for inferring functional dependencies, Data and Knowledge Engineering 12 (1994) 83-99.
36. J.C.C. McKinsey, The decision problem for some classes of sentences without quantifiers, Journal of Symbolic Logic 8(3) (1943) 61-77.
37. M. Minoux, LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation, Information Processing Letters 29 (1988) 1-12.
38. J.S. Provan and M.O. Ball, Efficient recognition of matroids and 2-monotonic systems, in: Applications of Discrete Mathematics, eds. R. Ringeisen and F. Roberts (SIAM, Philadelphia, PA, 1988) pp. 122-134.
39. W. Quine, A way to simplify truth functions, American Mathematical Monthly 62 (1955) 627-631.
40. B. Selman and H. Kautz, Knowledge compilation and theory approximation, Journal of ACM 43(2) (1996) 193-224.
41. Yu.I. Zhuravlev and A. Kogan, Realization of Boolean functions with a small number of zeros by disjunctive normal forms and related problems, Soviet Mathematics. Doklady 32(3) (1985) 771-775.