{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:12:51Z","timestamp":1775052771145,"version":"3.50.1"},"reference-count":73,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5798,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0304-3975(97)80755-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"1-59","source":"Crossref","is-referenced-by-count":15,"title":["A unifying view for logic programming with non-monotonic reasoning"],"prefix":"10.1016","volume":"184","author":[{"given":"Antonio","family":"Brogi","sequence":"first","affiliation":[]},{"given":"Evelina","family":"Lamma","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Mancarella","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Mello","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)80755-4_BIB1","unstructured":"J.J. Alferes, personal communication, 1993."},{"key":"10.1016\/S0304-3975(97)80755-4_BIB2","series-title":"Proc. ECAI94","first-page":"140","article-title":"Top-down query evaluation for well-founded semantics with explicit negation","author":"Alferes","year":"1994"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB3","series-title":"Proc. Internat. Symp. on Logic Programming ILPS94","article-title":"SLX \u2014 A top-down derivation procedure for programs with explicit negation","author":"Alferes","year":"1994"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00883931","article-title":"A logic programming system for non-monotonic reasoning","volume":"14","author":"Alferes","year":"1995","journal-title":"J. Automat. Reasoning"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB5","series-title":"Proc. 2nd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"334","article-title":"Scenario semantics of extended logic programs","author":"Alferes","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB6","series-title":"Proc. Internat. Joint Conf. and Symp. on Logic Programming","first-page":"574","article-title":"On logic program semantics with two kinds of negation","author":"Alferes","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB7","series-title":"Proc. 10th Internat. Conf. on Logic Programming","first-page":"601","article-title":"Optative reasoning with scenario semantics","author":"Alferes","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB8","series-title":"Proc. 4th Internat. Workshop on Extensions of Logic Programming","first-page":"11","article-title":"Contradiction: when avoidance equals removal \u2014 Part I","volume":"Vol. 798","author":"Alferes","year":"1994"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB9","series-title":"Proc. 4th Internat. Workshop on Extensions of Logic Programming","first-page":"268","article-title":"Contradiction: when avoidance equals removal \u2014 Part II","volume":"Vol. 798","author":"Alferes","year":"1994"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB10","series-title":"Proc. Int. Workshop on Artificial Intelligence and Mathematics","article-title":"\u201cClassical\u201d negation in non-monotonic reasoning and logic programming","author":"Alferes","year":"1996"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(94)00104-E","article-title":"On the Correctness of unfold\/fold transformation of normal and extended logic programs","volume":"24","author":"Aravindan","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB12","first-page":"493","article-title":"Logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB13","article-title":"Acyclic programs","volume":"9","author":"Apt","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0743-1066(94)90024-8","article-title":"Logic programming and negation: a survey","volume":"19\/20","author":"Apt","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","article-title":"Logic programming and knowledge representation","volume":"19\/20","author":"Baral","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB16","series-title":"Proc. 2nd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"171","article-title":"An Assumption-based framework for non-monotonic reasoning","author":"Bondarenko","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB17","series-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems FGCS92","first-page":"570","article-title":"Contributions to the semantics of open logic programs","author":"Bossi","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB18","series-title":"Proc. 2nd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"349","article-title":"An abductive framework for generalized logic programs","author":"Brewka","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB19","series-title":"Proc. Internat. Joint Conf. on Artificial Intelligence IJCAI93","first-page":"9","article-title":"An abductive framework for general logic programs and other nonmonotonic systems","author":"Brewka","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB20","series-title":"Proc. Internat. Joint Conf. and Symp. on Logic Programming","first-page":"783","article-title":"Normal logic programs as open positive programs","author":"Brogi","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB21","series-title":"Proc. 3rd Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"330","article-title":"An abductive framework for extended logic programming","volume":"Vol. 928","author":"Brogi","year":"1995"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB22","first-page":"1","article-title":"Compositional model-theoretic semantics for logic programs","volume":"11","author":"Brogi","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(95)00012-L","article-title":"Fully abstract compositional semantics for an algebra of logic programs","volume":"149","author":"Brogi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)80755-4_BIB24","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0743-1066(94)90032-9","article-title":"Modularity in logic programming","volume":"19\u201320","author":"Bugliesi","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB25","article-title":"Abductive logic programming","author":"Chen","year":"1989","journal-title":"Technical Report, Dept. of Computer Science, State University of New York"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB26","series-title":"Logic and Databases","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB27","first-page":"175","article-title":"Abductive reasoning through direct deduction from completed domains models","volume":"Vol. 4","author":"Console","year":"1989"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB28","series-title":"Proc. CADE-86","first-page":"608","article-title":"Causes for events: their computation and applications","author":"Cox","year":"1986"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB29","article-title":"Paraconsistent Logic Programming with Constraints","author":"Damasio","year":"1996"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB30","series-title":"Proc. 3rd Internat. Workshop on Logic Programming and Non Monotonic Reasoning","first-page":"29","article-title":"Abduction over 3-valued extended logic programs","volume":"Vol. 928","author":"Damasio","year":"1995"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB31","series-title":"Proc. Int. Joint Conf. and Symp. on Logic Programming","first-page":"686","article-title":"SLDNFA: an Abductive procedure for normal abductive programs","author":"Denecker","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB32","first-page":"147","article-title":"Representing incomplete knowledge in abductive logic programming","author":"Denecker","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB33","series-title":"Logic, Action and Information","article-title":"Semantics of logic programs: their intuitions and formal properties","author":"Dix","year":"1994"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB34","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","article-title":"A truth maintenance system","volume":"12","author":"Doyle","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB35","series-title":"Proc. 8th Internat. Conf. on Logic Programming ICLP91","first-page":"3","article-title":"Negation as hypothesis: an abductive foundation for logic programming","author":"Dung","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB36","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(92)90285-N","article-title":"On the Relations between stable and well-founded semantics of logic programs","volume":"105","author":"Dung","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)80755-4_BIB37","series-title":"Proc. Internat. Joint Conf. on Artificial Intelligence IJCAI93","first-page":"852","article-title":"On the acceptability of arguments and its fundamental role in non-monotonic reasoning","author":"Dung","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB38","series-title":"Proc. 10th Internat. Conf. on Logic Programming ICLP93","first-page":"616","article-title":"An argumentation semantics for logic programming with explicit negation","author":"Dung","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB39","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming and N-persons games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB40","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0743-1066(95)94697-X","article-title":"An argumentation-theoretic foundation for logic programming","volume":"22","author":"Dung","year":"1995","journal-title":"Logic Programming"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB41","series-title":"Proc. 1st Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"120","article-title":"Well-founded reasoning with classical negation","author":"Dung","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB42","series-title":"Proc. 6th Internat. Conf. on Logic Programming ICLP89","first-page":"234","article-title":"Abduction compared with negation by failure","author":"Eshghi","year":"1989"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB43","series-title":"Proc. 2nd Internat. Symp. on Artificial Intelligence","article-title":"Negation-as-failure as an approach to the Hanks and McDermott Problem","author":"Evans","year":"1989"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB44","series-title":"Proc. 5th Internat. Conf. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB45","series-title":"Proc. 7th Internat. Conf. on Logic Programming ICLP90","first-page":"579","article-title":"Logic programs with classical negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB46","series-title":"Proc. Internat. Joint Conf. and Symp. on Logic Programming","first-page":"559","article-title":"Representing actions in extended logic programming","author":"Gelfond","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB47","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","article-title":"Abductive logic programming","volume":"2","author":"Kakas","year":"1993","journal-title":"J. Logic and Comput."},{"key":"10.1016\/S0304-3975(97)80755-4_BIB48","series-title":"Proc. 9th European Conf. on Artificial Intelligence ECAI90","first-page":"385","article-title":"Generalized stable models: a semantics for abduction","author":"Kakas","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB49","series-title":"Proc. PRICAI90","article-title":"On the relation between truth maintenance and abduction","author":"Kakas","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB50","first-page":"341","article-title":"Preferred extensions are partial stable models","volume":"14","author":"Kakas","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB51","series-title":"Proc. Internat. Symp. of Logic Programming","first-page":"85","article-title":"Stable theories for logic programs","author":"Kakas","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB52","series-title":"Computational Logic \u2014 Symp. Proc.","first-page":"1","article-title":"Problems and promises of computational logic","author":"Kowalski","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB53","series-title":"Proc. 8th Internat. Conf. on Logic Programming ICLP91","first-page":"490","article-title":"Extended logic programs with default assumptions","author":"Inoue","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB54","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"627","article-title":"Equivalences of logic programs","author":"Maher","year":"1988"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB55","series-title":"Proc. Fifth Internat. Conf. and Symp. on Logic Programming","first-page":"1006","article-title":"An algebra of logic programs","author":"Mancarella","year":"1988"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB56","series-title":"Proc. ECAI92","first-page":"102","article-title":"Well founded semantics for logic programs with explicit negation","author":"Pereira","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB57","series-title":"Proc. 1st Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"105","article-title":"Contradiction removal within well-founded semantics","author":"Pereira","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB58","series-title":"Knowledge Representation and Reasoning under Uncertainty","first-page":"91","article-title":"Contradiction removal semantics with explicit negation","volume":"Vol. 808","author":"Pereira","year":"1994"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB59","series-title":"Proc. IJCAI91","first-page":"863","article-title":"Derivation procedures for extended stable models","author":"Pereira","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB60","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0743-1066(93)90032-C","article-title":"Non-monotonic reasoning with logic programming","volume":"17","author":"Pereira","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB61","series-title":"Proc. Automatic Algorithmic Debugging AADEBUG93","first-page":"58","article-title":"Debugging by diagnosing assumptions","volume":"Vol. 749","author":"Pereira","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB62","series-title":"Proc. 1st Internat. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"228","article-title":"Belief revision and paraconsistency in a logic programming framework","author":"Pimentel","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB63","first-page":"3","article-title":"Compiling a default reasoning system into prolog","volume":"9","author":"Poole","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB64","series-title":"Proc. 7th Internat. Conf. on Logic Programming","first-page":"459","article-title":"Extended stable semantics for normal and disjunctive programs","author":"Przymusinski","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB65","series-title":"Proc. DOOD'91","article-title":"Semantics of disjunctive logic programs and deductive databases","author":"Przymusinski","year":"1991"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB66","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"313","article-title":"A theorem-proving approach to database integrity","author":"Sadri","year":"1988"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB67","series-title":"Proc. Internat.Conference on Fifth Generation Computer Systems FGCS92","first-page":"592","article-title":"Extended well-founded semantics for paraconsistent logic programs","author":"Sakama","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB68","series-title":"Proc. Internat. Joint Conf. and Symp. on Logic Programming","first-page":"671","article-title":"A query evaluation method for abductive logic programming","author":"Satoh","year":"1992"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB69","series-title":"Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems","first-page":"205","article-title":"Stable models and non-determinism for logic programs with negation","author":"Sacc\u00e1","year":"1990"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB70","article-title":"Algorithms for treating abductive logic programming based on stable model semantics","author":"S\u00f8rli","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB71","series-title":"Proc. Internat. Logic Programming Symp. ILPS93","first-page":"235","article-title":"A proof procedure for extended logic programs","author":"Teusink","year":"1993"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB72","series-title":"Proc. ACM SIGMOD-SIGACT, Symp. on Principles of Database Systems","article-title":"Unfounded sets and the well-founded semantics for general logic programs","author":"Van Gelder","year":"1988"},{"key":"10.1016\/S0304-3975(97)80755-4_BIB73","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(94)00023-Y","article-title":"On the equivalence of semantics for normal logic programs","volume":"22","author":"You","year":"1995","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597807554?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597807554?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:22Z","timestamp":1556315902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597807554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":73,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0304397597807554"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)80755-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}