{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T22:13:39Z","timestamp":1673475219256},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01534455","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T17:51:39Z","timestamp":1113933099000},"page":"209-229","source":"Crossref","is-referenced-by-count":13,"title":["The expressiveness of locally stratified programs"],"prefix":"10.1007","volume":"15","author":[{"given":"Howard A.","family":"Blair","sequence":"first","affiliation":[]},{"given":"V. Wiktor","family":"Marek","sequence":"additional","affiliation":[]},{"given":"John S.","family":"Schlipf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"3","volume":"4","author":"H. Andreka","year":"1978","unstructured":"H. Andreka and I. Nemeti, The generalized completeness of Horn predicate logic as a programming language, Acta Cybern. 4(1978)3?10.","journal-title":"Acta Cybern."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt, Logic programming,Handbook of Theoretical Computer Science, ed. J. van Leeuven (Elsevier, 1990) pp. 495?574.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"CR3","volume-title":"Technical Report CS-R9010","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt and M. Bezem, Acyclic programs, Technical Report CS-R9010, Centre for Mathematics and Computer Science, Amsterdam (1990)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K.R. Apt","year":"1988","unstructured":"K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 89?148."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1990-13103","volume":"13","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt and H.A. Blair, Arithmetic classification of perfect models of stratified programs, Fundamenta Inf. 13(1990)1?17.","journal-title":"Fundamenta Inf."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FI-1991-14307","volume":"14","author":"K.R. Apt","year":"1991","unstructured":"K.R. Apt and H.A. Blair, Arithmetic classification of perfect models of stratified programs ? addendum, Fundamenta Inf. 14(1991)339?344.","journal-title":"Fundamenta Inf."},{"key":"CR7","first-page":"69","volume-title":"Dualities between alternative semantics for logic programming and non-monotonic reasoning","author":"C. Baral","year":"1991","unstructured":"C. Baral and V.S. Subrahmanian, Dualities between alternative semantics for logic programming and non-monotonic reasoning, in:Logic Programming and Non-Monotonic Reasoning: Proc. 1st Int. Workshop, eds. A. Nerode, W. Marek and V.S. Subrahmanian (MIT Press, Cambridge, MA, 1991) pp. 69?87."},{"key":"CR8","unstructured":"N. Bidoit and Ch. Froixdevaux, Negation by default and non stratifiable logic programs, Internal Report 437, Universit\u00e9 Paris-Sud (1988)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"H.A. Blair, The recursion-theoretic complexity of the semantics of predicate logic as a programming language, Inf. Contr. (July?August, 1982)25?47.","DOI":"10.1016\/S0019-9958(82)91234-7"},{"key":"CR10","unstructured":"C. Cholak and H. Blair, The complexity of local stratification, Manuscript (1991), submitted."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"M.H. van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23(1976)733?742.","journal-title":"J. ACM"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"M. Gelfond, Autoepistemic logic and formalization of commonsense reasoning,Non-Monotonic Reasoning, eds. M. Reinfrank, J. de Kleer, M.L. Ginsberg and E. Sandewall, Lecture Notes in Artificial Intelligence 346 (Springer, 1989) pp. 176?186.","DOI":"10.1007\/3-540-50701-9_27"},{"key":"CR13","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming,Proc. ICLP\/SLP-5 (1988) pp. 1070?1080."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"P.G. Hinman, Recursion-theoretic hierarchies,Persepctives in Mathematical Logic (Springer, 1978).","DOI":"10.1007\/978-3-662-12898-5"},{"key":"CR15","unstructured":"P.G. Kolaitis, The expressive power of stratified logic programs, Manuscript (1987)."},{"key":"CR16","unstructured":"Private communication."},{"key":"CR17","first-page":"569","volume-title":"Proc. IFIP Congress 1974","author":"R.A. Kowalski","year":"1974","unstructured":"R.A. Kowalski, Predicate logic as a programming language,Proc. IFIP Congress 1974 (North-Holland, Amsterdam, 1974) pp. 569?574."},{"key":"CR18","first-page":"172","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"V. Lifschitz","year":"1988","unstructured":"V. Lifschitz, On the declarative semantics of logic programs with negation,Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 172?192."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming, 2nd Ed. (Springer, 1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"CR20","unstructured":"W. Marek, A. Nerode and J. Remmel, A theory of nonmonotonic rule systems, MSI Technical Report 90-31, Mathematical Sciences Institute, Cornell University (1990)."},{"key":"CR21","unstructured":"W. Marek, A. Nerode and J. Remmel, How complicated is the set of stable models of a general logic program?, Technical Report, Mathematical Sciences Institute, Cornell University (1991)."},{"key":"CR22","unstructured":"W. Marek and V.S. Subrahmanian, The relationship between logic program semantics and nonmonotonic reasoning,Proc. 6th Int. Conf. on Logic Programming, eds. G. Levi and M. Martelli (MIT Press, 1989) pp. 600?617."},{"key":"CR23","first-page":"243","volume-title":"Stable semantics for logic programs and default theories","author":"W. Marek","year":"1989","unstructured":"W. Marek and M. Truszczy?ski, Stable semantics for logic programs and default theories,Proc. North American Conf. on Logic Programming (MIT Press, Cambridge, MA, 1989) pp. 243?256."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"A. Nerode and R. Shore,Logic for Applications (Springer, 1993).","DOI":"10.1007\/978-1-4684-0211-7"},{"key":"CR25","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"T. Przymusinski","year":"1988","unstructured":"T. Przymusinski, On the declarative semantics of deductive databases and logic programs, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988)."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"T. Przymusinski, Every logic program has a natural stratification and an iterated fixed point model,8th ACM Symp. on Principles of Database Systems (1989) pp. 11?21","DOI":"10.1145\/73721.73723"},{"key":"CR27","unstructured":"H. Rogers,Theory of Recursive Functions and Effective Computability (McGraw-Hill, 1967)."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"J. Schlipf, The expressive powers of the logic programming semantics, to appear in J. CSS. A preliminary version appeared in the9th ACM Symp. on Principles of Database Systems (1990).","DOI":"10.1145\/298514.298564"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(91)90003-8","volume":"10","author":"J.C. Shepherdson","year":"1991","unstructured":"J.C. Shepherdson, Unsolvable problems for SLDNF-resolution, J. Logic Progr. 10(1991)19?22.","journal-title":"J. Logic Progr."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J.C. Shepherdson","year":"1963","unstructured":"J.C. Shepherdson and H.E. Sturgis, Computability of recursive functions, J. ACM 10(1963)217?255.","journal-title":"J. ACM"},{"key":"CR31","doi-asserted-by":"crossref","volume-title":"Theory of Formal Systems","author":"R.M. Smullyan","year":"1961","unstructured":"R.M. Smullyan,Theory of Formal Systems (Princeton University Press, Princeton, NJ, 1961).","DOI":"10.1515\/9781400882007"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/B978-0-934613-40-8.50007-5","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"A. Gelder Van","year":"1988","unstructured":"A. Van Gelder, Negation as failure using tight derivations for general logic programs, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 149?176."},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The alternating fixpoint of logic programs with negation,8th ACM Symp. on Principles of Database Systems (1989) pp. 1?10.","DOI":"10.1145\/73721.73722"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder, K. Ross and J. Schlipf, The well-founded semantics for general logic programs, J. ACM 38(1991)620?650.","journal-title":"J. ACM"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01534455\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01534455.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01534455\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01534455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T06:24:48Z","timestamp":1625811888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01534455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01534455"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01534455","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":["Applied Mathematics","Artificial Intelligence"],"published":{"date-parts":[[1995,6]]}}}