{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:09:02Z","timestamp":1648724942707},"reference-count":26,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0020-0190(02)00290-9","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:38:56Z","timestamp":1034019536000},"page":"241-249","source":"Crossref","is-referenced-by-count":8,"title":["On the equivalence and range of applicability of graph-based representations of logic programs"],"prefix":"10.1016","volume":"84","author":[{"given":"Stefania","family":"Costantini","sequence":"first","affiliation":[]},{"given":"Ottavio","family":"D'Antona","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Provetti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00290-9_BIB001","series-title":"AAAI Spring Symposium ASP 2001","first-page":"1","article-title":"The prospect for answer set computation by a genetic model","author":"Bertoni","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB002","series-title":"Theory and Practice of Logic Programming","article-title":"Transformation-based bottom-up computation of the well-founded model","author":"Brass","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB003","series-title":"Proc. 1999 Conference on Information Technology","first-page":"197","article-title":"Characterizing and computing stable models of logic programs: the non-stratified case","author":"Brignoli","year":"1999"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB004","series-title":"Proc. IJC-SLP'96","first-page":"408","article-title":"Extremal problems in logic programming and stable model computation","author":"Cholewi\u0144ski","year":"1996"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB005","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(94)00259-L","article-title":"Contribution to the stable model semantics of logic programs with negation","volume":"149","author":"Costantini","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00290-9_BIB006","series-title":"AAAI Spring 2001 Symposium ASP 2001","first-page":"21","article-title":"On the existence of stable models of non-stratified logic programs","author":"Costantini","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB007","unstructured":"S. Costantini, On the existence of stable models of non-stratified logic programs, Submitted for publication, 2002"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB008","unstructured":"S. Costantini, A. Provetti, Normal forms for answer set programming, Submitted for publication, 2002"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB009","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","article-title":"Graph theoretical structures in logic programs and default theories","volume":"170","author":"Dimopoulos","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(02)00290-9_BIB010","series-title":"Proc. 5th ILPS Conference","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB011","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB012","series-title":"Proc. LPNMR01","first-page":"200","article-title":"Bounded LTL model checking with stable models","volume":"2173","author":"Heljanko","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB013","series-title":"Proc. ICLP'99 Conference","first-page":"23","article-title":"Answer set planning","author":"Lifschitz","year":"1999"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB014","series-title":"Proc. IJCAI-2001, Seattle, WA","first-page":"641","article-title":"Graph theoretical characterization and computation of answer sets","author":"Linke","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB015","series-title":"The Logic Programming Paradigm: a 25-Year Perspective","first-page":"375","article-title":"Stable models and an alternative logic programming paradigm","author":"Marek","year":"1999"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB016","series-title":"AAAI Spring 2001 Symposium ASP 2001","first-page":"124","article-title":"On the expressibility of stable Logic Programming","author":"Marek","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB017","series-title":"Proc. of Genetic and Evolutionary Computation GECCO 2000 \u201cLate breaking papers\u201d track","first-page":"303","article-title":"Answer sets computation by genetic algorithms, preliminary report","author":"Provetti","year":"2000"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB018","series-title":"Answer Set Programming: toward Efficient and Scalable Knowledge Representation and Reasoning, AAAI Spring Symposium","year":"2001"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB019","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jcss.1995.1053","article-title":"The expressive powers of the logic programming semantics","volume":"51","author":"Schlipf","year":"1995","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0020-0190(02)00290-9_BIB020_1","unstructured":"Web location of the most known ASP solvers."},{"key":"10.1016\/S0020-0190(02)00290-9_BIB020_2","unstructured":"CCALC: http:\/\/www.cs.utexas.edu\/users\/mcain\/cc"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB020_3","unstructured":"DeReS: http:\/\/www.cs.engr.uky.edu\/~lpnmr\/DeReS.html"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB020_4","unstructured":"DLV: http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB020_5","unstructured":"NoMoRe: http:\/\/www.cs.uni-potsdam.de\/~linke\/nomore\/"},{"key":"10.1016\/S0020-0190(02)00290-9_BIB020_6","unstructured":"SMODELS: http:\/\/www.tcs.hut.fi\/Software\/smodels\/"},{"issue":"3","key":"10.1016\/S0020-0190(02)00290-9_BIB021","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Van Gelder","year":"1990","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002909?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002909?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T11:52:12Z","timestamp":1555069932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0020019002002909"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00290-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}