{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:10Z","timestamp":1747548610622,"version":"3.40.5"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1018995303452","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"27-58","source":"Crossref","is-referenced-by-count":4,"title":["The logic of totally and partially ordered plans: a deductive database approach"],"prefix":"10.1007","volume":"19","author":[{"given":"Antonio","family":"Brogi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.S.","family":"Subrahmanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Zaniolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325411_CR1","unstructured":"S. Abieteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, 1995)."},{"key":"325411_CR2","unstructured":"K.R. Apt and M. Bezem, Acyclic programs, in: Proceedings Seventh International Conference on Logic Programming, eds. D.H.D. Warren and P. Szeredi (MIT Press, 1990) pp. 617\u2013633."},{"issue":"3","key":"325411_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF03037077","volume":"3","author":"K.A. Bowen","year":"1985","unstructured":"K.A. Bowen, Meta-level programming and knowledge representation, New Generation Computing 3(3) (1985) 359\u2013383.","journal-title":"New Generation Computing"},{"key":"325411_CR4","unstructured":"K.A. Bowen and R.A. Kowalski, Amalgamating language and metalanguage in logic programming, in: Logic Programming, eds. K.L. Clark and S.A. Tarnlund (Academic Press, 1982) pp. 153\u2013173."},{"key":"325411_CR5","unstructured":"A. Brogi, V.S. Subrahmanian and C. Zaniolo, Modeling sequential and parallel plans, Technical Report, Submitted for publication (1996)."},{"key":"325411_CR6","unstructured":"A. Brogi and F. Turini, Metalogic for knowledge representation, in: Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference, eds. J.A. Allen, R. Fikes and E. Sandewall (Morgan-Kaufmann, 1990) pp. 100\u2013106."},{"key":"325411_CR7","unstructured":"A. Brogi and C. Zaniolo, Converting linear and nonlinear plans into parallel execution plans, Technical Report, Department of Computer Science, UCLA (1995)."},{"key":"325411_CR8","doi-asserted-by":"crossref","unstructured":"J. Chomicki, Polynomial-time computable queries in temporal deductive databases, PODS'90 (1990).","DOI":"10.1145\/298514.298589"},{"key":"325411_CR9","unstructured":"J. Chomicki, Temporal deductive databases, in: Temporal Databases: Theory, Design and Implementation, eds. A. Tansel, J. Clifford, S. Gadia, S. Jagodia, A. Segev and R. Snodgrass (Benjamin\/Cummings, 1993) pp. 294\u2013320."},{"key":"325411_CR10","doi-asserted-by":"crossref","unstructured":"K.L. Clark, Negation as failure, in: Logic and Databases, eds. H. Gallaire and J. Minker (1978).","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"325411_CR11","doi-asserted-by":"crossref","unstructured":"L. Corciulo, F. Giannotti and D. Pedreschi, Datalog with non-deterministic choice compute ndbptime, in: Proc. International Conference on Deductive and Object-Oriented Databases, DOOD'93 (1993).","DOI":"10.1007\/3-540-57530-8_4"},{"key":"325411_CR12","doi-asserted-by":"crossref","unstructured":"K. Erol, D.S. Nau and V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence (1995).","DOI":"10.1016\/0004-3702(94)00080-K"},{"key":"325411_CR13","unstructured":"K. Eshgi and R.A. Kowalski, Abduction compared with negation as failure, in: Proceedings Sixth International Conference on Logic Programming, eds. G. Levi and M. Martelli (MIT Press, 1989) pp. 234\u2013254."},{"key":"325411_CR14","unstructured":"C. Evans, Negation-as-failure as an approach to the Hanks and McDermott problem, in: Proceedings Second Int'l Symp. on Artificial Intelligence (1989)."},{"key":"325411_CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"R. Fikes","year":"1971","unstructured":"R. Fikes and N. Nilsson, STRIPS: A new approach to the application of theorem proving in problem solving, Artificial Intelligence 2(3,4) (1971) 189\u2013208.","journal-title":"Artificial Intelligence"},{"key":"325411_CR16","unstructured":"M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Logic Programming: Proceedings of the Fifth Int`l Conf. and Symposium, eds. R.A. Kowalski and K. Bowen (1988) pp. 1070\u20131080."},{"key":"325411_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0743-1066(93)90035-F","volume":"17","author":"M. Gelfond","year":"1993","unstructured":"M. Gelfond and V. Lifschitz, Representing action and change by logic programs, Journal of Logic Programming 17 (1993) 301\u2013322.","journal-title":"Journal of Logic Programming"},{"key":"325411_CR18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","volume":"33","author":"S. Hanks","year":"1987","unstructured":"S. Hanks and D. McDermott, Nonmonotonic logic and temporal projection, Artificial Intelligence 33 (1987) 379\u2013412.","journal-title":"Artificial Intelligence"},{"key":"325411_CR19","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming (Springer-Verlag, 2nd edition, 1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"325411_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(92)90019-C","volume":"103","author":"V. Marek","year":"1992","unstructured":"V. Marek and V.S. Subrahmanian, The relationship between stable, supported, default and auto-epistemic semantics for general logic programs, Theoretical Computer Science 103 (1992) 365\u2013386.","journal-title":"Theoretical Computer Science"},{"key":"325411_CR21","unstructured":"V. W. Marek and M. Truszczynski, Nonmonotonic Logic (Springer-Verlag, 1995)."},{"key":"325411_CR22","unstructured":"D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings of the Ninth National Conference on Artificial Intelligence (MIT Press, 1991) pp. 634\u2013639."},{"key":"325411_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"26","author":"J. McCarthy","year":"1986","unstructured":"J. McCarthy, Applications of circumsription to formalising common sense reasoning, Artificial Intelligence 26 (1986) 89\u2013116.","journal-title":"Artificial Intelligence"},{"key":"325411_CR24","first-page":"101","volume":"6","author":"D. McDermott","year":"1982","unstructured":"D. McDermott, A temporal logic for reasoning about processes and plans, Cognitive Science 6 (1982) 101\u2013155.","journal-title":"Cognitive Science"},{"key":"325411_CR25","unstructured":"J. Pinto and R. Reiter, Temporal reasoning in logic programming: A case for the situation calculus, in: Proc. 1993 Intl. Conf. on Logic Programming (MIT Press, 1993) pp. 203\u2013221."},{"key":"325411_CR26","doi-asserted-by":"crossref","unstructured":"T. Przymusinski, On the declarative and procedural semantics of stratified deductive databases, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann, 1988) pp. 193\u2013216.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"325411_CR27","doi-asserted-by":"crossref","unstructured":"D. Sacc\u00e0 and C. Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proc. 9th ACM Symp. on Principles of Database Systems (1990).","DOI":"10.1145\/298514.298572"},{"key":"325411_CR28","unstructured":"E. Sacerdoti, The nonlinear nature of plans, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-75) (1975) pp. 206\u2013214."},{"key":"325411_CR29","doi-asserted-by":"crossref","unstructured":"V.S. Subrahmanian and C. Zaniolo, Relating stable models and AI planning domains, in: Proc. 12th International Conference on Logic Programming, ICLP'95 (1995).","DOI":"10.7551\/mitpress\/4298.003.0030"},{"key":"325411_CR30","unstructured":"A. Tate, Generating project networks, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-77) (1977) pp. 889\u2013900."},{"key":"325411_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01228882","volume":"3","author":"J. Vaghani","year":"1994","unstructured":"J. Vaghani, K. Ramamohanarao, D.B. Kemp, Z. Somogyi, P.J. Stuckey, T.S. Leask and J. Harland, The Aditi deductive database system, VLDB Journal 3 (1994) 245\u2013288.","journal-title":"VLDB Journal"},{"key":"325411_CR32","unstructured":"D.H.D. Warren, An abstract prolog instruction set, Technical Report, SRI International (1983)."},{"key":"325411_CR33","unstructured":"D.S. Weld, An introduction to least commitment planning, A.I. Magazine (1995)."},{"key":"325411_CR34","doi-asserted-by":"crossref","unstructured":"C. Zaniolo, A unified semantics for active and deductive databases, in: Proceedings of the 1st International Workshop on Rules in Database Systems (1933) pp. 271\u2013287.","DOI":"10.1007\/978-1-4471-3225-7_16"},{"key":"325411_CR35","unstructured":"C. Zaniolo, Transaction-conscious stable model semantics for active database rules, in: Proc. International Conference on Deductive Object-Oriented Databases, DOOD'95 (1995)."},{"key":"325411_CR36","doi-asserted-by":"crossref","unstructured":"C. Zaniolo, N. Arni and K. Ong, Negation and aggregates in recursive rules: the ldl++ approach, in: Proc. International Conference on Deductive and Object-Oriented Databases, DOOD'93 (1993).","DOI":"10.1007\/3-540-57530-8_13"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018995303452.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018995303452\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018995303452.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:43:54Z","timestamp":1747547034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018995303452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["325411"],"URL":"https:\/\/doi.org\/10.1023\/a:1018995303452","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}