{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T01:12:39Z","timestamp":1768353159466,"version":"3.49.0"},"reference-count":58,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0022-0000(93)90024-q","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"185-221","source":"Crossref","is-referenced-by-count":105,"title":["The alternating fixpoint of logic programs with negation"],"prefix":"10.1016","volume":"47","author":[{"given":"Allen","family":"Van Gelder","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"No. 2","key":"10.1016\/0022-0000(93)90024-Q_BIB1_1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0022-0000(90)90036-K","article-title":"Procedural languages for database queries and updates","volume":"41","author":"Abiteboul","year":"1990","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB1_2","series-title":"ACM Symposium on Principles of Database Systems","author":"Abiteboul","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB2","series-title":"Handbook of Mathematical Logic","first-page":"739","article-title":"An introduction to inductive definitions","author":"Aczel","year":"1977"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB3","series-title":"6th ACM Symp. on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB4","series-title":"Foundations of Deductive Database and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"issue":"No. 3","key":"10.1016\/0022-0000(93)90024-Q_BIB5","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90024-Q_BIB6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","article-title":"Negation by Default and Unstratifiable Logic Programs","volume":"78","author":"Bidoit","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB7","series-title":"Eighth ACM Symposium on Principles of Database Systems","first-page":"34","article-title":"Logic programming as constructiveism: A formalization and its application to database","author":"Bry","year":"1989"},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90024-Q_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause queries and generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90024-Q_BIB9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput System Sci."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB10","series-title":"Post Correspondence Problem and Prolog Programs","author":"Cholak","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB11","series-title":"Logic and Database","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB12","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":"Artif. Intell."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB13","series-title":"A Natural Semantics for Logic Programs with Negation","author":"Dung","year":"1989"},{"issue":"No. 2","key":"10.1016\/0022-0000(93)90024-Q_BIB14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0004-3702(90)90086-F","article-title":"A rational reconstruction of nonmonotonic truth maintenance systems","volume":"43","author":"Elkan","year":"1990","journal-title":"Artif. Intell."},{"issue":"No. 4","key":"10.1016\/0022-0000(93)90024-Q_BIB15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB16","series-title":"Fifth Int'l Conf. Symp. on Logic Programming","first-page":"1054","article-title":"Stratified and three-valued logic programming semantics","author":"Fitting","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB17","series-title":"Proc. AAAI","article-title":"On stratified autoepistemic theories","author":"Gelfond","year":"1987"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB18","series-title":"Fifth Int'l Conf. Symp. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","article-title":"Fixed-point extensions of first order logic","volume":"32","author":"Gurevich","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90024-Q_BIB20","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB21","unstructured":"P. G. Kolaitis, The expressive power of stratified programs, Inform. and Comput. to appear; also UCSC-CRL-89-14 from University of California, Santa Cruz."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB22","series-title":"ACM Symposium on Principles of Database Systems","first-page":"231","article-title":"Why not negation by fixpoint?","author":"Kolaitis","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB23","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"issue":"No. 4","key":"10.1016\/0022-0000(93)90024-Q_BIB24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB25_1","article-title":"Some Remarks on the Completed Database","author":"Kunen","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB25_2","series-title":"5th Int'l Conf. Symp. on Logic Programming, Seattle","author":"Kunen","year":"1988"},{"issue":"No. 2","key":"10.1016\/0022-0000(93)90024-Q_BIB26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0890-5401(90)90006-4","article-title":"Inductive definitons over finite structures","volume":"89","author":"Leivant","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB27","series-title":"Foundations of Deductive Database and Logic Programming","first-page":"177","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB28","series-title":"First International Conference on Principles of Knowledge Representation and Reasoning","first-page":"235","article-title":"Between circumscription and autoepistemic logic","author":"Lifschitz","year":"1989"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB29","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"issue":"No. 3","key":"10.1016\/0022-0000(93)90024-Q_BIB30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making Prolog more expressive","volume":"1","author":"Lloyd","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB31","series-title":"Autoepistemic Logic","author":"Marek","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB32","series-title":"Foundations of Deductive Database and Logic Programming","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB33","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantical considerations on non-monotonic logic","volume":"28","author":"Moore","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB34","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB35","series-title":"Formal Approaches to Artificial Intelligence: A Sourcebook","article-title":"Semantic issues in deductive database and logic programs","author":"Przymusinska","year":"1990"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB36","series-title":"Fifth Int'I Conf. Symp. on Logic Programming","first-page":"1106","article-title":"Weakly perfect model semantics for logic programs","author":"Przymusinska","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB37","series-title":"Foundations of Deductive Database and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive database and logic programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB38","series-title":"Eighth ACM Symposium on Principles of Database Systems","first-page":"11","article-title":"Every logic program has a natural stratification and an iterated fixed point model","author":"Przymusinski","year":"1989"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB39","series-title":"Logic and Database","first-page":"50","article-title":"On closed world databases","author":"Reiter","year":"1987"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB40","series-title":"Eight ACM Symposium on Principles of Database Systems","first-page":"22","article-title":"A procedural semantics for well-founded negation in logic programs","author":"Ross","year":"1989"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB41","series-title":"Ninth ACM Symposium on Principles of Database Systems","first-page":"161","article-title":"Modular stratification and magic sets for Datalog programs with negation","author":"Ross","year":"1990"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB42_1","series-title":"Partial Models, Stable Models and Non-determinism in Logic Programs with Negation","author":"Sacca","year":"1990"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB42_2","series-title":"Ninth ACM Symposium on Principles of Database Systems","author":"Sacca","year":"1990"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB43","series-title":"Inductive Definability and Semantics of Logic Programs","author":"Schlipf","year":"1989"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB44","series-title":"International Symposium on Artificial Intelligence and Mathematics","article-title":"Formalizing a logic for logic programming","author":"Schlipf","year":"1990"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB45","series-title":"Ninth ACM Symposium on Principles of Database Systems","first-page":"196","article-title":"The expressive powers of the logic programming semantics","author":"Schlipf","year":"1990"},{"issue":"No. 3","key":"10.1016\/0022-0000(93)90024-Q_BIB46","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","article-title":"Negation as failure, II","volume":"2","author":"Shepherdson","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB47","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in logic programming","author":"Shepherdson","year":"1988"},{"issue":"No. 4","key":"10.1016\/0022-0000(93)90024-Q_BIB48","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"Van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90024-Q_BIB49","series-title":"Eighth ACM Symposium on Principles of Database Systems","first-page":"1","article-title":"The alternating fixpoint of logic programs with negation","author":"Van Gelder","year":"1989"},{"issue":"No. 1","key":"10.1016\/0022-0000(93)90024-Q_BIB50_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0743-1066(89)90032-0","article-title":"Negation as failure using tight derivations for general logic programs","volume":"6","author":"Van Gelder","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB50_2","series-title":"Third IEEE Symp. on Logic Programming","author":"Van Gelder","year":"1986"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB50_3","article-title":"Foundations of Deductive Database and Logic Programming","author":"Van Gelder","year":"1988"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB51_1","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, K. A. Ross, and J. S. Schlipf, The well-founded semantics for general logic programs, J. Assoc. Comput. Mach., to appear","DOI":"10.1145\/116825.116838"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB52","series-title":"14th ACM Symposium on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0022-0000(93)90024-Q_BIB53","series-title":"Ninth ACM Symposium on Principles of Database Systems","first-page":"196","article-title":"Three-valued formalization of logic programming: Is it needed?","author":"You","year":"1990"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390024Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390024Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:57:57Z","timestamp":1550325477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390024Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002200009390024Q"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90024-q","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}