{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:11Z","timestamp":1725522251676},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_54","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"667-671","source":"Crossref","is-referenced-by-count":4,"title":["Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Riguzzi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-27775-0_30","volume-title":"Logic Programming","author":"J. Vennekens","year":"2004","unstructured":"Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 431\u2013445. Springer, Heidelberg (2004)"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Vennekens, J., Verbaeten, S.: Logic programs with annotated disjunctions. Technical Report CW386, K. U. Leuven (2003), http:\/\/www.cs.kuleuven.ac.be\/~joost\/techrep.ps","DOI":"10.1007\/978-3-540-27775-0_30"},{"issue":"1-2","key":"54_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0004-3702(97)00027-1","volume":"94","author":"D. Poole","year":"1997","unstructured":"Poole, D.: The Independent Choice Logic for modelling multiple agents under uncertainty. Artif. Intell.\u00a094(1-2), 7\u201356 (1997)","journal-title":"Artif. Intell."},{"issue":"1-3","key":"54_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0743-1066(99)00071-0","volume":"44","author":"D. Poole","year":"2000","unstructured":"Poole, D.: Abducing through negation as failure: stable models within the independent choice logic. J. Log. Program.\u00a044(1-3), 5\u201335 (2000)","journal-title":"J. Log. Program."},{"key":"54_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-74782-6_11","volume-title":"AI*IA 2007: Artificial Intelligence and Human-Oriented Computing","author":"F. Riguzzi","year":"2007","unstructured":"Riguzzi, F.: A top down interpreter for LPAD and CP\u2013logic. In: Basili, R., Pazienza, M.T. (eds.) AI*IA 2007. LNCS (LNAI), vol.\u00a04733, pp. 109\u2013120. Springer, Heidelberg (2007)"},{"key":"54_CR6","first-page":"92","volume-title":"Symposium on Principles of Database Systems","author":"K.A. Ross","year":"1991","unstructured":"Ross, K.A.: Modular acyclicity and tail recursion in logic programs. In: Symposium on Principles of Database Systems, pp. 92\u2013101. ACM Press, New York (1991)"},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W. Chen","year":"1995","unstructured":"Chen, W., Swift, T., Warren, D.S.: Efficient top-down computation of queries under the well-founded semantics. J. Log. Program.\u00a024(3), 161\u2013199 (1995)","journal-title":"J. Log. Program."},{"key":"54_CR8","first-page":"168","volume-title":"Symposium on Principles of Database Systems","author":"W. Chen","year":"1993","unstructured":"Chen, W., Warren, D.S.: Query evaluation under the well founded semantics. In: Symposium on Principles of Database Systems, pp. 168\u2013179. ACM Press, New York (1993)"},{"key":"54_CR9","unstructured":"Riguzzi, F.: The SLGAD procedure for inference opn logic programs with annotated disjunctions. Technical Report CS-2008-01, University of Ferrara (2008), http:\/\/www.unife.it\/dipartimento\/ingegneria\/informazione\/informatica\/rapporti-tecnici-1\/cs-2008-01.pdf\/view"},{"key":"54_CR10","unstructured":"Chen, W., Warren, D.: Towards effective evaluation of general logic programs. Technical report, State University of New York, Stony Brook (1993)"},{"key":"54_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-45587-6_21","volume-title":"Practical Aspects of Declarative Languages","author":"L.F. Castro","year":"2002","unstructured":"Castro, L.F., Swift, T., Warren, D.S.: Suspending and resuming computations in engines for SLG evaluation. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, pp. 332\u2013350. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T08:06:33Z","timestamp":1557993993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}