{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:52Z","timestamp":1725550132067},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292081"},{"type":"electronic","value":"9783540319474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11562931_17","type":"book-chapter","created":{"date-parts":[[2005,10,8]],"date-time":"2005-10-08T13:28:42Z","timestamp":1128778122000},"page":"204-220","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid Probabilistic Logic Programs with Non-monotonic Negation"],"prefix":"10.1007","author":[{"given":"Emad","family":"Saad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","volume":"19\/20","author":"K.R. Apt","year":"1994","unstructured":"Apt, K.R., Bol, R.N.: Logic programming and negation:a survey. Journal of logic programming\u00a019\/20, 9\u201371 (1994)","journal-title":"Journal of logic programming"},{"key":"17_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24609-1_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C. Baral","year":"2003","unstructured":"Baral, C., et al.: Probabilistic reasoning with answer sets. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 21\u201333. Springer, Heidelberg (2003)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Damasio, C.V., Pereira, L.M.: Hybrid probabilistic logic programs as residuated logic programs. In: JELIA (2000)","DOI":"10.1007\/3-540-40006-0_5"},{"key":"17_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-46767-X_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C.V. Damasio","year":"1999","unstructured":"Damasio, C.V., et al.: Coherent well-founded annotated logic programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, p. 262. Springer, Heidelberg (1999)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0743-1066(99)00059-X","volume":"43","author":"A. Dekhtyar","year":"2000","unstructured":"Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic program. Journal of Logic Programming\u00a043(3), 187\u2013250 (2000)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming\u00a01(3), 267\u2013284 (1984)","journal-title":"Journal of Logic Programming"},{"key":"17_CR7","volume-title":"ICSLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICSLP. MIT Press, Cambridge (1988)"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(93)90024-Q","volume":"47","author":"A. Gelder Van","year":"1993","unstructured":"Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences\u00a047(1), 185\u2013221 (1993)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"17_CR9","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of ACM"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0743-1066(92)90007-P","volume":"12","author":"M. Kifer","year":"1992","unstructured":"Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. Journal of Logic Programming\u00a012, 335\u2013367 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S1471068400001058","volume":"1","author":"L.V.S. Lakshmanan","year":"2001","unstructured":"Lakshmanan, L.V.S., Sadri, F.: On a theory of probabilistic deductive databases. Journal of Theory and Practice of Logic Programming\u00a01(1), 5\u201342 (2001)","journal-title":"Journal of Theory and Practice of Logic Programming"},{"issue":"4","key":"17_CR12","first-page":"554","volume":"13","author":"L.V.S. Lakshmanan","year":"2001","unstructured":"Lakshmanan, L.V.S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE TKDE\u00a013(4), 554\u2013570 (2001)","journal-title":"IEEE TKDE"},{"key":"17_CR13","volume-title":"FLOPS","author":"Y. Loyer","year":"2002","unstructured":"Loyer, Y., Straccia, U.: The well-founded semantics in normal logic programs with uncertainty. In: FLOPS. Springer, Heidelberg (2002)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Loyer, Y., Straccia, U.: The approximate well-founded semantics for logic programs with uncertainty. In: 28th International Symposium on Mathematical Foundations of Computer Science (2003)","DOI":"10.1007\/978-3-540-45138-9_48"},{"key":"17_CR15","unstructured":"Lukasiewicz, T.: Probabilistic logic programming. In: 13th European Conference on Artificial Intelligence, pp. 388\u2013392 (1998)"},{"key":"17_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-46767-X_20","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Lukasiewicz","year":"1999","unstructured":"Lukasiewicz, T.: Many-valued disjunctive logic programs with probabilistic semantics. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, p. 277. Springer, Heidelberg (1999)"},{"key":"17_CR17","unstructured":"Niemela, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Joint International Conference and Symposium on Logic Programming, pp. 289\u2013303 (1996)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information & Computation\u00a0101(2) (1992)","DOI":"10.1016\/0890-5401(92)90061-J"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. ARJ\u00a010(2) (1993)","DOI":"10.1007\/BF00881836"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Subrahmanian, V.S.: Stable semantics for probabilistic deductive databases. Information & Computation\u00a0110(1) (1994)","DOI":"10.1006\/inco.1994.1023"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Saad, E.: Hybrid probabilistic programs with non-monotonic negation: semantics and algorithms. Ph.D. thesis, New Mexico State University (May 2005)","DOI":"10.1007\/11562931_17"},{"key":"17_CR22","volume-title":"Practical Aspects of Declarative Languages","author":"E. Saad","year":"2005","unstructured":"Saad, E., Pontelli, E.: Towards a more practical hybrid probabilistic logic programming framework. In: Practical Aspects of Declarative Languages. Springer, Heidelberg (2005)"},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/176567.176571","volume":"19","author":"V.S. Subrahmanian","year":"1994","unstructured":"Subrahmanian, V.S.: Amalgamating knowledge bases. ACM TDS\u00a019(2), 291\u2013331 (1994)","journal-title":"ACM TDS"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562931_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:06Z","timestamp":1605642726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562931_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292081","9783540319474"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11562931_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}