{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:03:17Z","timestamp":1772830997615,"version":"3.50.1"},"reference-count":64,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5132,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0743-1066(98)10030-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"1-46","source":"Crossref","is-referenced-by-count":32,"title":["Semantics of (disjunctive) logic programs based on partial evaluation"],"prefix":"10.1016","volume":"40","author":[{"given":"Stefan","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Dix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(94)00104-E","article-title":"On the correctness of unfold\/fold transformations of normal and extended logic programs","volume":"24","author":"Aravindan","year":"1995","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB2","article-title":"Confluent rewriting systems for logic programming semantics","author":"Arrazola","year":"1997"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB3","series-title":"Nonmonotic Extensions of Logic Programming","first-page":"127","article-title":"A general approach to bottom-up computation of disjunctive semantics","author":"Brass","year":"1995"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB4","series-title":"Proceedings of the 12th Int. Conf. on Logic Programming","first-page":"199","article-title":"Disjunctive semantics based upon partial and bottom-up evaluation","author":"Brass","year":"1995"},{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB5_1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","article-title":"Characterizations of the disjunctive stable semantics by partial evaluation","volume":"32","author":"Brass","year":"1997","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB5_2","series-title":"Proceedings of the Third International Conference","first-page":"85","article-title":"Characterizations of the Stable Semantics by Partial Evaluation LPNMR","author":"Brass","year":"1995"},{"issue":"1","key":"10.1016\/S0743-1066(98)10030-4_BIB6_1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1005952908693","article-title":"Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA","volume":"20","author":"Brass","year":"1998","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB6_2","first-page":"268","article-title":"Characteristics D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence","author":"Brass","year":"1996"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB7","article-title":"Knowledge representation with extended logic programs","volume":"vol. 6","author":"Brewka","year":"1998"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB8","series-title":"Proceedings of The Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98)","article-title":"A comparison of the static and the disjunctive well-founded semantics and its implementation","author":"Brass","year":"1998"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB9","series-title":"Proceedings of The Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR '96)","first-page":"529","article-title":"Super logic programs","author":"Brass","year":"1996"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB10","series-title":"Third Int. Conf. on Advances in Database Technology (EDBT'92)","first-page":"88","article-title":"Generalized bottom-up query evaluation","volume":"580","author":"Brass","year":"1992"},{"issue":"6","key":"10.1016\/S0743-1066(98)10030-4_BIB11","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1145\/195613.195637","article-title":"Mixed integer programming methods for computing non-monotonic deductive databases","volume":"41","author":"Bell","year":"1994","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB12","series-title":"Innovationen bei Rechen- und Kommunikationssystemen (IFIP-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases)","first-page":"75","article-title":"Improved bottom-up query evaluation in positive disjunctive databases","author":"Brass","year":"1994"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB13","series-title":"Habilitationsschrift, Fachbereich Mathematik","article-title":"Bottom-up query evaluation in extended deductive databases","author":"Brass","year":"1996"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB14","series-title":"Proc. of The Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System (PODS'89)","first-page":"34","article-title":"Logic programming as constructivism: A formalization and its appplication to databases","author":"Bry","year":"1989"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB15","series-title":"Information Systems and Artificial Intelligence: Integration Aspects","first-page":"30","article-title":"Negation in logic programming: A formalization in constructive logic","author":"Bry","year":"1990"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB16","series-title":"Non-Monotonic Extensions of Logic Programming (NMELP'96)","first-page":"171","article-title":"Transformation-based bottom-up computation of the well-founded model","author":"Brass","year":"1997"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB17","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB18","series-title":"Nonmonotonic Extensions of Logic Programming","first-page":"156","article-title":"Static semantics as program transformation and well-founded computation","author":"Costantini","year":"1995"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB19","series-title":"Logic and Data-Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0743-1066(94)00028-5","article-title":"Efficient top-down computation of queries under the well-founded semantics","volume":"24","author":"Chen","year":"1995","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB21","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-1066(93)90034-E","article-title":"A goal oriented approach to computing the well-founded semantics","volume":"17","author":"Chen","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB22","first-page":"279","article-title":"Computing of stable models and its integration with logical query processing","volume":"17","author":"Chen","year":"1995","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"10.1016\/S0743-1066(98)10030-4_BIB23","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/227595.227597","article-title":"Tabled evaluation with delaying for general logic programs","volume":"43","author":"Chen","year":"1996","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB24","series-title":"Handbook of Automated Reasoning","article-title":"Nonmonotonic reasoning: towards efficient calculi and implementations","author":"Dix","year":"1996"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB25","series-title":"Proceedings of The Third International Conference on Principles of Knowledge Representation and Reasoning (KR '92)","first-page":"591","article-title":"A framework for representing and characterizing semantics of logic programs","author":"Dix","year":"1992"},{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","article-title":"A classification-theory of semantics of normal logic programs: I. Strong properties","volume":"XXII","author":"Dix","year":"1995","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB27","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","article-title":"A classification-theory of semantics of normal logic programs: II. Weak properties","volume":"XXII","author":"Dix","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB28","series-title":"Logic, Action and Information \u2014 Essays on Logic in Philosophy and Artificial Intelligence","first-page":"241","article-title":"Semantics of logic programs: their intuitions and formal properties. An overview","author":"Dix","year":"1995"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB29","series-title":"Proceedings of North American Conference Cleveland","article-title":"A fixpoint approach to declarative semantics of logic programs","author":"Dung","year":"1989"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB30","series-title":"Proceedings of The Ninth Conference on Foundations of Software Technology and Theoretical Computer Science","article-title":"A natural semantics for logic programs with negation","author":"Dung","year":"1989"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB31","series-title":"Logic Programming and Non-Monotonic Reasoning, Proceedings of The Second International Workshop","first-page":"43","article-title":"Implementing semantics for disjunctive logic programs using fringes and abstract properties","author":"Dix","year":"1993"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB32","series-title":"Proceedings of The 11th Int. Conf. on Logic Programming, S. Margherita Ligure","first-page":"303","article-title":"An axiomatic framework for representing and characterizing semantics of disjunctive logic programs","author":"Dix","year":"1994"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB33","series-title":"Proceedings of The Eighth Int. Symp. on Methodologies for Intelligent Systems","first-page":"511","article-title":"Partial evaluation and relevance for approximations of the stable semantics","author":"Dix","year":"1994"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB34","series-title":"Proceedings of The 1997 International Symposium on Logic Programming","first-page":"505","article-title":"On well-behaved semantics suitable for aggregation","author":"Dix","year":"1997"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB35","series-title":"Proceedings of The International Symposium on Computer Science in Mexico","first-page":"313","article-title":"Provability closures in logic programming","author":"Dix","year":"1997"},{"issue":"1\u20133","key":"10.1016\/S0743-1066(98)10030-4_BIB36","first-page":"5","article-title":"A framework to incorporate nonmonotonic reasoning into constraint logic programming","volume":"37","author":"Dix","year":"1988","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB37","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics of logic programs","volume":"4","author":"Fitting","year":"1985","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB38","series-title":"The Fifth Conference on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB39_1","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\/S0743-1066(98)10030-4_BIB39_2","series-title":"Proceedings of The Seventh International Logic Programming Conference","first-page":"579","article-title":"Logic programs with classical negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB40","series-title":"Proceedings of The Seventh Symposium on Principles of Database Systems","article-title":"The extended closed world assumption and its relationship to parallel circumscription","author":"Gelfond","year":"1988"},{"issue":"5","key":"10.1016\/S0743-1066(98)10030-4_BIB41","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/int.4550050507","article-title":"On the relationship between CWA, minimal model and minimal Herbrand model semantics","volume":"5","author":"Gelfond","year":"1990","journal-title":"International Journal of Intelligent Systems"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB42","series-title":"Proceedings of The Eighth Int. Conf. on Logic Programming","first-page":"412","article-title":"Extended well-founded model semantics for general logic programs","author":"Hu","year":"1991"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB43","series-title":"Proceedings of The 1991 Int. Symposium on Logic Programming","first-page":"337","article-title":"Magic sets and bottom-up evaluation of well-founded models","author":"Kemp","year":"1991"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB44","series-title":"Proceedings of The Sixth Conference on Automated Deduction","first-page":"292","article-title":"On indefinite databases and the closed world assumption","author":"Minker","year":"1982"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB45","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","article-title":"A fixpoint semantics for disjunctive logic programs","volume":"9","author":"Minker","year":"1990","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB46","series-title":"Proceedings of The Joint International Conference and Symposium on Logic Programming","first-page":"289","article-title":"Efficient implementation of the well-founded and stable model semantics","author":"Niemel\u00e4","year":"1996"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB47","series-title":"Deductive and Object-Oriented Databases, Second Int. Conf. (DOOD'91)","first-page":"85","article-title":"Semantics of disjunctive logic programs and deductive databases","author":"Przymusinski","year":"1991"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB48_1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","article-title":"Stable semantics for disjunctive programs","volume":"9","author":"Przymusinski","year":"1991","journal-title":"New Generation Computing Journal"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB48_2","series-title":"Proceedings of The Seventh International Logic Programming Conference","first-page":"459","article-title":"Extended stable semantics for normal and disjunctive logic programs","author":"Przymusinski","year":"1990"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB49","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01530826","article-title":"Static semantics for normal and disjunctive logic programs","volume":"14","author":"Przymusinski","year":"1995","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB50","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","article-title":"Weak generalized closed world assumption","volume":"5","author":"Rajasekar","year":"1989","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB51","series-title":"Proceedings of The First International Conference on Deductive and Object Oriented Databases","first-page":"1","article-title":"The well-founded semantics for disjunctive logic programs","author":"Ross","year":"1989"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB52","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","article-title":"Inferring negative information from disjunctive databases","volume":"4","author":"Ross","year":"1988","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB53","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01543479","article-title":"Formalizing a logic for logic programming","volume":"5","author":"Schlipf","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0743-1066(98)10030-4_BIB54","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jcss.1995.1053","article-title":"The expressive powers of the logic programming semantics","volume":"5","author":"Schlipf","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB55","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/69.390244","article-title":"WFS + Branch and Bound = Stable Models","volume":"17","author":"Subrahmanian","year":"1995","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB56","series-title":"Logic Program Synthesis and Transformation Meta Programming in Logic","first-page":"170","article-title":"Partial deduction of disjunctive logic programs: a declarative approach","author":"Sakama","year":"1994"},{"issue":"3","key":"10.1016\/S0743-1066(98)10030-4_BIB57","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0743-1066(96)00120-3","article-title":"Partial deduction in disjunctive logic programming","volume":"32","author":"Sakama","year":"1977","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB58","series-title":"Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"1","article-title":"The alternating fixpoint of logic programs with negation","author":"Van Gelder","year":"1989"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB59","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0743-1066(98)10030-4_BIB60","series-title":"Proc. of The Fourth Int. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR '97)","first-page":"40","article-title":"Improving the alternating fixpoint: the transformation approach","author":"Zukowski","year":"1997"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106698100304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106698100304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:07:18Z","timestamp":1580843238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106698100304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0743106698100304"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(98)10030-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}