Parameter learning of logic programs for symbolic-statistical modeling

Journal of Artificial Intelligence Research

Volumn 15, Issue , 2001, Pages 391-454

  Sato, Taisuke ^a   Kameya, Yoshitaka ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; SEMANTICS;

BAUM-WELCH ALGORITHM; LEAST HERBRAND MODEL; PARAMETERIZED DISTRIBUTION;

FORMAL LOGIC;

EID: 4444281941     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.912     Document Type: Article

References (72)

1. Abney, S. (1997). Stochastic attribute-value grammars. Computational Linguistics, 23(4), 597-618.
2. Arimura, H. (1997). Learning acyclic first-order horn sentences from entailment. In Proceedings of the Eighth International Workshop on Algorithmic Learning Theory. Ohmsha/Springer-Verlag.
3. Bacchus, F., Grove, A., Halpern, J., & Koller, D. (1996). From statistical knowledge bases to degrees of belief. Artificial Intelligence, 87, 75-143.
4. Baker, J. K. (1979). Trainable grammars for speech recognition. In Proceedings of Spring Conference of the Acoustical Society of America, pp. 547-550.
5. Beil, F., Carroll, G., Prescher, D., Riezler, S., & Rooth, M. (1999). Inside-Outside estimation of a lexicalized PCFG for German. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL'99), pp. 269-276.
6. Breese, J. S. (1992). Construction of belief and decision networks. Computational Intelligence, 8(4), 624-647.
7. Carroll, G., & Rooth, M. (1998). Valence induction with a head-lexicalized PCFG. In Proceedings of the 3rd Conference on Empirical Methods in Natural Language Processing (EMNLP 3).
8. Castillo, E., Gutierrez, J. M., & Hadi, A. S. (1997). Expert Systems and Probabilistic Network Models. Springer-Verlag.
9. Charniak, E., & Carroll, G. (1994). Context-sensitive statistics for improved grammatical language models. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI'94), pp. 728-733.
10. Chi, Z., & Geman, S. (1998). Estimation of probabilistic context-free grammars. Computational Linguistics, 24(2), 299-305.
11. Chow, Y., & Teicher, H. (1997). Probability Theory (3rd ed.). Springer.
12. Clark, K. (1978). Negation as failure. In Gallaire, H., & Minker, J. (Eds.), Logic and Databases, pp. 293-322. Plenum Press.
13. Cormen, T., Leiserson, C., & Rivest, R. (1990). Introduction to Algorithms. The MIT Press.
14. Cussens, J. (1999). Loglinear models for first-order probabilistic reasoning. In Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI'99), pp. 126-133.
15. Cussens, J. (2001). Parameter estimation in stochastic logic programs. Machine Learning, 44(3), 245-271.
16. D'Ambrosio, B. (1999). Inference in Bayesian networks. AI Magazine, summer, 21-36.
17. Dekhtyar, A., & Subrahmanian, V. S. (1997). Hybrid probabilistic programs. In Proceedings of the 14th International Conference on Logic Programming (ICLP'97), pp. 391-405.
18. Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Royal Statistical Society, B39(1), 1-38.
19. Doets, K. (1994). From Logic to Logic Programming. The MIT Press.
20. Flach, P., & Kakas, A. (Eds.). (2000). Abduction and Induction - Essays on Their Relation and Integration. Kluwer Academic Publishers.
21. Frish, A., & Haddawy, P. (1994). Anytime deduction for probabilistic logic. Journal of Artificial Intelligence, 69, 93-122.
22. Fujisaki, T., Jelinek, F., Cocke, J., Black, E., & Nishino, T. (1989). A probabilistic parsing method for sentence disambiguation. In Proceedings of the 1st International Workshop on Parsing Technologies, pp. 85-94.
23. Japan EDR, L. (1995). EDR electronic dictionary technical guide (2nd edition). Technical report, Japan Electronic Dictionary Research Institute, Ltd.
24. Kakas, A. C., Kowalski, R. A., & Toni, F. (1992). Abductive logic programming. Journal of Logic and Computation, 2(6), 719-770.
25. Kameya, Y. (2000). Learning and Representation of Symbolic-Statistical Knowledge (in Japanese). Ph. D. dissertation, Tokyo Institute of Technology.
26. Kameya, Y., & Sato, T. (2000). Efficient EM learning for parameterized logic programs. In Proceedings of the 1st Conference on Computational Logic (CL2000), Vol. 1861 of Lecture Notes in Artificial Intelligence, pp. 269-294. Springer.
27. Kita, K. (1999). Probabilistic Language Models (in Japanese). Tokyo Daigaku Syuppan-kai.
28. Koller, D., McAllester, D., & Pfeffer, A. (1997). Effective Bayesian inference for stochastic programs. In Proceedings of 15th National Conference on Artificial Intelligence (AAAI'97), pp. 740-747.
29. Koller, D., & Pfeffer, A. (1997). Learning probabilities for noisy first-order rules. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 1316-1321.
30. Kyburg, H. (1994). Uncertainty logics. In Gabbay, D., Hogger, C., & Robinson, J. (Eds.), Handbook of Logics in Artificial Intelligence and Logic Programming, pp. 397-438. Oxford Science Publications.
31. Lafferty, J. (1993). A derivation of the Inside-Outside Algorithm from the EM algorithm. Technical report, IBM T.J. Watson Research Center.
32. Lakshmanan, L. V. S., & Sadri, F. (1994). Probabilistic deductive databases. In Proceedings of the 1994 International Symposium on Logic Programming (ILPS'94), pp. 254-268.
33. Lari, K., & Young, S. J. (1990). The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 4, 35-56.
34. Li, Z., & D'Ambrosio, B. (1994). Efficient inference in Bayes networks as a combinatorial optimization problem. International Journal of Approximate Reasoning, 11, 55-81.
35. Lloyd, J. W. (1984). Foundations of Logic Programming. Springer-Verlag.
36. Lukasiewicz, T. (1999). Probabilistic deduction with conditional constraints over basic events. Journal of Artificial Intelligence Research, 10, 199-241.
37. Manning, C. D., & Schütze, H. (1999). Foundations of Statistical Natural Language Processing. The MIT Press.
38. McLachlan, G. J., & Krishnan, T. (1997). The EM Algorithm and Extensions. Wiley Interscience.
39. Muggleton, S. (1996). Stochastic logic programs. In de Raedt, L. (Ed.), Advances in Inductive Logic Programming, pp. 254-264. IOS Press.
40. Ng, R., & Subrahmanian, V. S. (1992). Probabilistic logic programming. Information and Computation, 101, 150-201.
41. Ngo, L., & Haddawy, P. (1997). Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171, 147-177.
42. Nilsson, N. J. (1986). Probabilistic logic. Artificial Intelligence, 28, 71-87.
43. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann.
44. Pereira, F. C. N., & Schabes, Y. (1992). Inside-Outside reestimation from partially bracketed corpora. In Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics (ACL'92), pp. 128-135.
45. Pereira, F. C. N., & Warren, D. H. D. (1980). Definite clause grammars for language analysis - a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13, 231-278.
46. Pfeffer, A., & Koller, D. (2000). Semantics and inference for recursive probability models. In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI'00), pp. 538-544.
47. Poole, D. (1993). Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64 (1), 81-129.
48. Pynadath, D. V., & Wellman, M. P. (1998). Generalized queries on probabilistic context-free grammars. IEEE Transaction on Pattern Analysis and Machine Intelligence, 20(1), 65-77.
49. Rabiner, L. R. (1989). A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2), 257-286.
50. Rabiner, L. R., & Juang, B. (1993). Foundations of Speech Recognition. Prentice-Hall.
51. Ramakrishnan, I., Rao, P., Sagonas, K., Swift, T., & Warren, D. (1995). Efficient tabling mechanisms for logic programs. In Proceedings of the 12th International Conference on Logic Programming (ICLP'95), pp. 687-711. The MIT Press.
52. Reddy, C., & Tadepalli, P. (1998). Learning first-order acyclic horn programs from entailment. In Proceedings of the 15th International Conference on Machine Learning; (and Proceedings of the 8th International Conference on Inductive Logic Programming). Morgan Kaufmann.
53. Riezler, S. (1998). Probabilistic Constraint Logic Programming. Ph.D. thesis, Universität Tübingen.
54. Rubin, D. (1976). Inference and missing data. Biometrika, 63(3), 581-592.
55. Sagonas, K., T., S., & Warren, D. (1994). XSB as an efficient deductive database engine. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pp. 442-453.
56. Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In Proceedings of the 12th International Conference on Logic Programming (ICLP'95), pp. 715-729.
57. Sato, T. (1998). Modeling scientific theories as PRISM programs. In Proceedings of ECAI'98 Workshop on Machine Discovery, pp. 37-45.
58. Sato, T. (2001). Minimum likelihood estimation from negative examples in statistical abduction. In Proceedings of IJCAI-01 workshop on Abductive Reasoning, pp. 41-47.
59. Sato, T., & Kameya, Y. (1997). PRISM: a language for symbolic-statistical modeling. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 1330-1335.
60. Sato, T., & Kameya, Y. (2000). A Viterbi-like algorithm and EM learning for statistical abduction. In Proceedings of UAI2000 Workshop on Fusion of Domain Knowledge with Data for Decision Support.
61. Sato, T., Kameya, Y., Abe, S., & Shirai, K. (2001). Fast EM learning of a family of PCFGs. Titech technical report (Dept. of CS) TR01-0006, Tokyo Institute of Technology.
62. Shen, Y., Yuan, L., You, J., & Zhou, N. (2001). Linear tabulated resolution based on Prolog control strategy. Theory and Practice of Logic Programming, 1(1), 71-103.
63. Sterling, L., & Shapiro, E. (1986). The Art of Prolog. The MIT Press.
64. Stolcke, A. (1995). An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2), 165-201.
65. Tamaki, H., & Sato, T. (1984). Unfold/fold transformation of logic programs. In Proceedings of the 2nd International Conference on Logic Programming (ICLP'84), Lecture Notes in Computer Science, pp. 127-138. Springer.
66. Tamaki, H., & Sato, T. (1986). OLD resolution with tabulation. In Proceedings of the 3rd International Conference on Logic Programming (ICLP'86), Vol. 225 of Lecture Notes in Computer Science, pp. 84-98. Springer.
67. Tanaka, H., Takezawa, T., & Etoh, J. (1997). Japanese grammar for speech recognition considering the MSLR method. In Proceedings of the meeting of SIG-SLP (Spoken Language Processing), 97-SLP-15-25, pp. 145-150. Information Processing Society of Japan. In Japanese.
68. Uratani, N., Takezawa, T., Matsuo, H., & Morita, C. (1994). ATR integrated speech and language database. Technical report TR-IT-0056, ATR Interpreting Telecommunications Research Laboratories. In Japanese.
69. Warren, D. S. (1992). Memoing for logic programs. Communications of the ACM, 35(3), 93-111.
70. Wetherell, C. S. (1980). Probabilistic languages: a review and some open questions. Computing Surveys, 12(4), 361-379.
71. White, H. C. (1963). An Anatomy of Kinship. Prentice-Hall.
72. Zhang, N., & Poole, D. (1996). Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research, 5, 301-328.