{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:24:47Z","timestamp":1743107087162,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354703"},{"type":"electronic","value":"9783540354710"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780496_23","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T05:37:40Z","timestamp":1151473060000},"page":"201-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Stochastic Logical Automaton"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Watanabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,29]]},"reference":[{"key":"24_CR1","unstructured":"McCarthy, J., Hayes, P.J.: Some Philosophical Problems from the Standpoint of Artificial Intelligence. In: Machine Intelligence, vol.\u00a04, pp. 463\u2013502. Edinburgh University Press (1969)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Rabiner, L.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE\u00a077 (1989)","DOI":"10.1109\/5.18626"},{"key":"24_CR3","unstructured":"Watanabe, H., Muggleton, S.: First-Order Stochastic Action Language. Electronic Transactions in Artificial Intelligence\u00a07 (2002), http:\/\/www.doc.ic.ac.uk\/~hw3\/doc\/watanabe02FirstSAL.ps"},{"key":"24_CR4","unstructured":"H. Watanabe, S. Muggleton.: Towards Belief Propagation in Shared Logic Program, BN2003, Kyoto (2003), http:\/\/www.doc.ic.ac.uk\/~hw3\/doc\/bn2003final2.pdf"},{"key":"24_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3540635149_49","volume-title":"Inductive Logic Programming","author":"S. Moyle","year":"1997","unstructured":"Moyle, S., Muggleton, S.H.: Learning programs in the event calculus. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS (LNAI), vol.\u00a01297, pp. 205\u2013212. Springer, Heidelberg (1997)"},{"key":"24_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-44797-0_16","volume-title":"Inductive Logic Programming","author":"R. Otero","year":"2001","unstructured":"Otero, R.: Induction of Stable Models. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 193\u2013205. Springer, Heidelberg (2001)"},{"key":"24_CR7","unstructured":"Kersting, K., Raiko, T., De Raedt, L.: Logical Hidden Markov Models (Extended Abstract). In: Ga\u2019mez, J.A., Salmero\u2019n, A. (eds.) Proceedings of the First European Workshop on Probabilistic Graphical Models (PGM-02), Cuenca, Spain, November 6-8, 2002, pp. 99\u2013107 (2002)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-30109-7_16","volume-title":"Inductive Logic Programming","author":"K. Kersting","year":"2004","unstructured":"Kersting, K., De Raedt, L.: Logical markov decision programs and the convergence of logical TD(\u03bb). In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS, vol.\u00a03194, pp. 180\u2013197. Springer, Heidelberg (2004)"},{"key":"24_CR9","unstructured":"Morton-Firth, C.J.: Stochastic simulation of cell signalling pathways Ph.D. Thesis, University of Cambridge (1998)"},{"key":"24_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-58473-0_134","volume-title":"Grammatical Inference and Applications","author":"P. Dupont","year":"1994","unstructured":"Dupont, P., Miclet, L., Vidal, E.: What is the search space of Regular Inference? In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol.\u00a0862, pp. 25\u201337. Springer, Heidelberg (1994)"},{"key":"24_CR11","unstructured":"Coste, F., Fredouille, D.: What is the search space for the inference of non deterministic, unambiguous and deterministic automata? technical report INRIA RR-4907 (2003)"},{"key":"24_CR12","unstructured":"Plotkin, G.: Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, UK (1971)"},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"24_CR14","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"Angluin, D.: Negative Results for Equivalence Queries. Machine Learning\u00a05, 121\u2013150 (1990)","journal-title":"Machine Learning"},{"key":"24_CR15","first-page":"433","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1989","unstructured":"Kearns, M., Valiant, L.G.: Cryptographic limitations on learning boolean formulae and finite automata. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 433\u2013444. ACM Press, New York (1989)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"24_CR17","unstructured":"Halpern, J.Y.: An analysis of first-order logics of probability. In: Proceedings of IJCAI-1989, 11th International Joint Conference on Artificial Intelligence, pp. 1375\u20131381 (1989)"},{"key":"24_CR18","first-page":"254","volume-title":"Advances in Inductive Logic Programming","author":"S.H. Muggleton","year":"1996","unstructured":"Muggleton, S.H.: Stochastic logic programs. In: de Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 254\u2013264. IOS Press, Amsterdam (1996)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Taisuke Sato.: A statistical learning method for logic programs with distribution semantics. Proc. ICLP 1995, Syounan-village, pages 715\u2013729, 1995.","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"24_CR20","series-title":"LNAI","first-page":"138","volume-title":"Inductive Logic Programming","author":"K. Kersting","year":"2000","unstructured":"Kersting, K., Raedt, L.D.: Bayesian Logic Programs. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, pp. 138\u2013155. Springer, Heidelberg (2000)"},{"key":"24_CR21","first-page":"1300","volume-title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","author":"N. Friedman","year":"1999","unstructured":"Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 1300\u20131309. Morgan Kaufmann Publishers, San Francisco (1999)"},{"key":"24_CR22","volume-title":"Artificial Intelligence: A Modern Approach","author":"S. Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)","edition":"2"},{"key":"24_CR23","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Kietz, J.-U., L\u00fcbbe, M.: An efficient subsumption algorithm for inductive logic programming. In: Proc. of the 4th International Workshop on Inductive Logic Programming (ILP-1994), pp. 97\u2013105 (1994)","DOI":"10.1016\/B978-1-55860-335-6.50024-6"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11780496_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T00:06:10Z","timestamp":1707091570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11780496_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354703","9783540354710"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11780496_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"29 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}