{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:18Z","timestamp":1761610518799,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4867,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s1571-0661(05)80660-7","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"235-255","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Debugging Prolog Using Annotations"],"prefix":"10.1016","volume":"30","author":[{"given":"M.","family":"Kula\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80660-7_BIB1","unstructured":"Edinburgh University A. I. Applications Institute. Edinburgh Prolog tools. ftp:\/\/sunsite.doc.ic.ac.Uk\/packages\/prolog-pd-software\/tools.tar.Z, 1988."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB2","unstructured":"Lawrence Byrd. Understanding the control flow of Prolog programs. In S. A. T\u2013rnlund, editor, Proc. of the Logic Programming Workshop, pages 127\u2013138, Debrecen, Hungary, 1980. Also as D. A. I. Research Paper No. 151."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB3","unstructured":"M. Carlsson. Personal communication, Sept. 1999."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","article-title":"Inductive assertion method for logic programs","volume":"59","author":"Drabent","year":"1988","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80660-7_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0743-1066(98)10036-5","article-title":"Opium: An extendable trace analyzer for Prolog","volume":"39","author":"Ducass\u00e9","year":"1999","journal-title":"J. of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80660-7_BIB6","series-title":"The Logic Programming Paradigm: A 25-Year Perspective","article-title":"Using global analysis, partial specifications, and an extensible assertion language for program validation and debugging","author":"Hermenegildo","year":"1999"},{"key":"10.1016\/S1571-0661(05)80660-7_BIB7","unstructured":"M. Kula\u0161. Annotations for Prolog \u2013 A concept and runtime handling. In LOPSTR'99: 9th Internat. Workshop on Logic-based Program Synthesis and Transformation. Universita' Ca' Foscari di Venezia, Rapporto di Ricerca CS-99-16, Sept. 1999. Also to appear in LNCS, Springer-Verlag, 2000."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB8","unstructured":"Gregor Meyer. Type checking and type inferencing for logic programs with subtypes and parametric polymorphism. Informatik Berichte 200, FernUniversit\u00e4t Hagen, 1996. Also tutorial on ICLP'97. Source distribution http:\/\/www.fernuni-hagen.de\/pi8\/typical."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB9","unstructured":"U. Neumerkel. A programming course for declarative programming with Prolog, http:\/\/www.complang.tuwien.ac.at\/ulrich\/gupu\/material\/1997-gupu.ps.gz, 1997."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB10","unstructured":"R. A. O'Keefe. Re: parser in C. Thread in comp.lang.prolog, Sept. 1994."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB11","unstructured":"Richard A. O'Keefe. advice.pl. In DEC-10 Prolog Library [1]. Interlisp-like advice package, 1984."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB12","unstructured":"Quintus Corp., Palo Alto, CA. Quintus Prolog Language and Library, 1991. Release 3.1. Also library sources."},{"key":"10.1016\/S1571-0661(05)80660-7_BIB13","series-title":"Machine Intelligence 5","article-title":"Transformational systems and the algebraic structure of atomic formulas","author":"Reynolds","year":"1970"},{"year":"1983","series-title":"Algorithmic Program Debugging","author":"Shapiro","key":"10.1016\/S1571-0661(05)80660-7_BIB14"},{"issue":"3","key":"10.1016\/S1571-0661(05)80660-7_BIB15","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0743-1066(97)10013-9","article-title":"The theoretical foundations of LPTP (a logic program theorem prover)","volume":"36","author":"St\u00e4rk","year":"1998","journal-title":"J. of Logic Programming"},{"key":"10.1016\/S1571-0661(05)80660-7_BIB16","unstructured":"G. Tobermann and C. Beckstein. What's in a trace: The box model revisited. In Proc. of the First Internat. Workshop on Automated and Algorithmic Debugging, Link\u00f6ping, Sweden, volume 749 of LNCS. Springer-Verlag, 1993."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:49Z","timestamp":1761610129000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S1571066105806607"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80660-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Debugging Prolog Using Annotations","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80660-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}