{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:06:17Z","timestamp":1725512777656},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699118"},{"type":"electronic","value":"9783540699125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69912-5_12","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T17:30:41Z","timestamp":1187631041000},"page":"143-158","source":"Crossref","is-referenced-by-count":4,"title":["Towards the Computation of Stable Probabilistic Model Semantics"],"prefix":"10.1007","author":[{"given":"Emad","family":"Saad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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)"},{"issue":"6","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1145\/195613.195637","volume":"41","author":"C. Bell","year":"1994","unstructured":"Bell, C., et al.: Mixed integer programming methods for computing Nonmonotonic Deductive Databases. Journal of ACM\u00a041(6), 1178\u20131215 (1994)","journal-title":"Journal of ACM"},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/69.542027","volume":"8","author":"W.D. Chen","year":"1996","unstructured":"Chen, W.D., Warren, D.S.: Computation of stable models and its integration with logical query processing. IEEE Transaction on Knowledge and Data Engineering\u00a08(5), 742\u2013757 (1996)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"issue":"1-2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0004-3702(99)00053-3","volume":"112","author":"P. Cholewinski","year":"1999","unstructured":"Cholewinski, P., et al.: Computing with default logic. Artificial Intelligence\u00a0112(1-2), 105\u2013146 (1999)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"12_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"},{"key":"12_CR6","unstructured":"Dekhtyar, M., Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic programs: algorithms and complexity. In: Uncertainty in Artificial Intelligence Conference, pp. 160\u2013169 (1999)"},{"issue":"3","key":"12_CR7","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"},{"issue":"1","key":"12_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":"12_CR9","doi-asserted-by":"publisher","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":"12_CR10","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Fifth International Conference and Symposium on Logic Programming, pp. 1070\u20131080 (1988)"},{"issue":"1","key":"12_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"},{"key":"12_CR12","first-page":"69","volume-title":"Principles of Knowledge Representation","author":"V. Lifschitz","year":"1996","unstructured":"Lifschitz, V.: Foundations of logic programming. In: Principles of Knowledge Representation, pp. 69\u2013127. CSLI Publications, Stanford (1996)"},{"key":"12_CR13","volume-title":"International Conference on Logic Programming","author":"J.J. Lu","year":"1994","unstructured":"Lu, J.J., Leach, S.M.: Computing annotated logic programs. In: van Hentenryck, P. (ed.) International Conference on Logic Programming, MIT press, Cambridge (1994)"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Marek, W., Truszczynski, M.: Autoepistemic logic. Journal of ACM\u00a038(3), 588\u2013619 (1991)","journal-title":"Journal of ACM"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(92)90061-J","volume":"101","author":"R.T. Ng","year":"1992","unstructured":"Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation\u00a0101(2), 150\u2013201 (1992)","journal-title":"Information and Computation"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1006\/inco.1994.1023","volume":"110","author":"R.T. Ng","year":"1994","unstructured":"Ng, R.T., Subrahmanian, V.S.: Stable semantics for probabilistic deductive databases. Information and Computation\u00a0110(1), 42\u201383 (1994)","journal-title":"Information and Computation"},{"key":"12_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":"12_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-46767-X_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemela","year":"1999","unstructured":"Niemela, I., Simons, P., Soininen, T.: Stable model semantics of weight constraint rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, pp. 317\u2013331. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013(1-2), 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"12_CR20","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":"12_CR21","series-title":"Lecture Notes in Computer Science","first-page":"67","volume-title":"Practical Aspects of Declarative Languages","author":"E. Pontelli","year":"2005","unstructured":"Pontelli, E., Saad, E.: Towards a More Practical Hybrid Probabilistic Logic Programming Framework. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2004. LNCS, vol.\u00a03350, pp. 67\u201382. Springer, Heidelberg (2005)"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","first-page":"204","volume-title":"Logic Programming","author":"E. Pontelli","year":"2005","unstructured":"Pontelli, E., Saad, E.: Hybrid Probabilistic Logic Programs with Non-monotonic Negation. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 204\u2013220. Springer, Heidelberg (2005)"},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/69.390244","volume":"7","author":"V.S. Subrahmanian","year":"1995","unstructured":"Subrahmanian, V.S., Nau, D.S., Vago, C.: wfs + branch and bound = stable models. IEEE Transaction on Knowledge and Data Engineering\u00a07(3), 362\u2013377 (1995)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: International Workshop on Nonmonotonic Reasoning (2004)","DOI":"10.1007\/978-3-540-27775-0_30"}],"container-title":["Lecture Notes in Computer Science","KI 2006: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69912-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:11:54Z","timestamp":1620000714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69912-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699118","9783540699125"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69912-5_12","relation":{},"subject":[]}}