{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:48:46Z","timestamp":1693864126056},"reference-count":44,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"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":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90091-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"95-120","source":"Crossref","is-referenced-by-count":5,"title":["Stratified least fixpoint logic"],"prefix":"10.1016","volume":"131","author":[{"given":"Kevin J.","family":"Compton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90091-4_bib1","series-title":"Handbook of Mathematical Logic","first-page":"739","article-title":"Introduction to inductive definitions","author":"Aczel","year":"1977"},{"key":"10.1016\/0304-3975(94)90091-4_bib2","series-title":"Proc. 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\/0304-3975(94)90091-4_bib3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic: A survey \u2013 part I","volume":"3","author":"Apt","year":"1981","journal-title":"Acm Trans. Prog. Lang. System"},{"key":"10.1016\/0304-3975(94)90091-4_bib4","first-page":"493","article-title":"Logic programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0304-3975(94)90091-4_bib5","series-title":"Proc. 5rd Internat. Conf. on Logic Programming","first-page":"765","article-title":"Arithmetic classification of perfect models of stratified programs","author":"Apt","year":"1988"},{"key":"10.1016\/0304-3975(94)90091-4_bib6","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0304-3975(94)90091-4_bib7","article-title":"Correctness Preserving Program Refinements: Proof Theory and Applications","volume":"Vol. 131","author":"Back","year":"1980"},{"key":"10.1016\/0304-3975(94)90091-4_bib8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00289263","article-title":"Proving total correctness of programs in infinitary logic","volume":"15","author":"Back","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90091-4_bib9","series-title":"Proc. 3rd Internat. Conf. on Logic Programming","first-page":"600","article-title":"Completeness of the SLDNF-resolution for a class of logic programs","volume":"Vol. 225","author":"Barbuti","year":"1986"},{"key":"10.1016\/0304-3975(94)90091-4_bib10","series-title":"Admissible Sets and Structures","author":"Barwise","year":"1975"},{"key":"10.1016\/0304-3975(94)90091-4_bib11","series-title":"Computation Theory and Logic","first-page":"20","article-title":"Existential fixed-point logic","volume":"Vol. 270","author":"Blass","year":"1987"},{"key":"10.1016\/0304-3975(94)90091-4_bib12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause queries and generalizations","volume":"1","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90091-4_bib13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02248730","article-title":"Program invariants as fixedpoints","volume":"21","author":"Clarke","year":"1979","journal-title":"Computing"},{"key":"10.1016\/0304-3975(94)90091-4_bib14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/322108.322121","article-title":"Programming language constructs for which it is impossible to obtain Hoare axiom systems","volume":"26","author":"Clarke","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)90091-4_bib15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1093\/logcom\/3.2.197","article-title":"A deductive system for existential least fixpoint logic","volume":"3","author":"Compton","year":"1993","journal-title":"Logic Comput."},{"key":"10.1016\/0304-3975(94)90091-4_bib16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"78","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90091-4_bib17","first-page":"841","article-title":"Methods and logics for proving programs","volume":"Vol. B","author":"Cousot","year":"1990"},{"key":"10.1016\/0304-3975(94)90091-4_bib18","series-title":"Computation Theory and Logic","first-page":"101","article-title":"Skolem normal forms concerning the least fixpoint","volume":"Vol. 270","author":"Dahlhaus","year":"1986"},{"key":"10.1016\/0304-3975(94)90091-4_bib19","article-title":"Recursive Program Schemes: Semantics and Proof Theory","volume":"Vol. 70","author":"de Roever","year":"1976"},{"key":"10.1016\/0304-3975(94)90091-4_bib20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","article-title":"Algorithmic properties of structures","volume":"1","author":"Engeler","year":"1967","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)90091-4_bib21","series-title":"Foundations of Computer Science","first-page":"57","article-title":"Algorithmic logic","volume":"Vol. 63","author":"Engeler","year":"1975"},{"key":"10.1016\/0304-3975(94)90091-4_bib22","article-title":"First-order dynamic logic","volume":"Vol. 68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(94)90091-4_bib23","first-page":"497","article-title":"Dynamic logic","volume":"Vol. II","author":"Harel","year":"1984"},{"key":"10.1016\/0304-3975(94)90091-4_bib24","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. Acm"},{"key":"10.1016\/0304-3975(94)90091-4_bib25","series-title":"Symp. on Semantics of Algorithmic Languages","first-page":"112","article-title":"Procedures and parameters: An axiomatic approach","volume":"Vol. 188","author":"Hoare","year":"1971"},{"key":"10.1016\/0304-3975(94)90091-4_bib26","first-page":"1073","article-title":"Elements of relational database theory","volume":"Vol. B","author":"Kanellakis","year":"1990"},{"key":"10.1016\/0304-3975(94)90091-4_bib27","series-title":"Languages with Expressions of Infinite Length","author":"Karp","year":"1964"},{"key":"10.1016\/0304-3975(94)90091-4_bib28","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","article-title":"The expressive power of stratified logic programs","volume":"90","author":"Kolaitis","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(94)90091-4_bib29","first-page":"789","article-title":"Logics of programs","volume":"Vol. B","author":"Kozen","year":"1990"},{"key":"10.1016\/0304-3975(94)90091-4_bib30","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","article-title":"Fixed point theorems and semantics: A folk tale","volume":"14","author":"Lassez","year":"1982","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0304-3975(94)90091-4_bib31","series-title":"Proc. 11th Acm Symp. on Principles of Programming Languages","first-page":"132","article-title":"Logical and mathematical reasoning about imperative programs","author":"Leivant","year":"1984"},{"key":"10.1016\/0304-3975(94)90091-4_bib32","series-title":"Proc. 18th IEEE Symp. on Foundations of Computer Science","first-page":"1","article-title":"A necessary and sufficient condition for the existence of Hoare logics","author":"Lipton","year":"1977"},{"key":"10.1016\/0304-3975(94)90091-4_bib33","series-title":"Foundations of Program Verification","author":"Loeckx","year":"1984"},{"key":"10.1016\/0304-3975(94)90091-4_bib34","doi-asserted-by":"crossref","first-page":"253","DOI":"10.4064\/fm-57-3-253-272","article-title":"An interpolation theorem for denumerably long sentences","volume":"57","author":"Lopez-Escobar","year":"1965","journal-title":"Fundam. Math."},{"key":"10.1016\/0304-3975(94)90091-4_bib35","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0304-3975(94)90091-4_bib36","article-title":"Negation and Control in PROLOG","volume":"Vol. 238","author":"Naish","year":"1986"},{"key":"10.1016\/0304-3975(94)90091-4_bib37","first-page":"59","article-title":"Fixpoint induction and proofs of program properties","volume":"Vol. 5","author":"Park","year":"1969"},{"key":"10.1016\/0304-3975(94)90091-4_bib38","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","article-title":"Finiteness is \u03bc-ineffable","volume":"3","author":"Park","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90091-4_bib39","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of deductive databases and logic programs","author":"Przymusi\u0144ski","year":"1988"},{"key":"10.1016\/0304-3975(94)90091-4_bib40","first-page":"227","article-title":"Formalised algorithmic languages","volume":"18","author":"Salwicki","year":"1981","journal-title":"Bull. Acad. Pol. Sci. Ser. Sci. Math. Astron. Phy."},{"key":"10.1016\/0304-3975(94)90091-4_bib41","series-title":"Ph.D. thesis","article-title":"Proving programs correct using abstract, high-level logic","author":"Stavely","year":"1977"},{"key":"10.1016\/0304-3975(94)90091-4_bib42","series-title":"Proof Theory","author":"Takeuti","year":"1987"},{"key":"10.1016\/0304-3975(94)90091-4_bib43","article-title":"Program Correctness over Abstract Data Types","volume":"Vol. 6","author":"Tucker","year":"1988"},{"key":"10.1016\/0304-3975(94)90091-4_bib44","series-title":"Proc. 3rd IEEE Conf. on Logic Programming","first-page":"127","article-title":"Negation as failure using tight derivations for general logic programs","author":"Van Gelder","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900914?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900914?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:17Z","timestamp":1555129697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594900914"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90091-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}