{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:40:19Z","timestamp":1725493219466},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441908"},{"type":"electronic","value":"9783540457572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45757-7_16","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T13:50:39Z","timestamp":1192888239000},"page":"186-197","source":"Crossref","is-referenced-by-count":4,"title":["Answer Set Planning under Action Costs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerald","family":"Pfeifer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Polleres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. L. Blum","year":"1997","unstructured":"A. L. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281\u2013300, 1997.","journal-title":"Artificial Intelligence"},{"key":"16_CR2","unstructured":"B. Bonet and H. Geffner. Planning with incomplete information as heuristic search in belief space. In Proc. AIPS\u201900, pp. 52\u201361, 2000."},{"issue":"5","key":"16_CR3","first-page":"845","volume":"12","author":"F. Buccafurri","year":"2000","unstructured":"F. Buccafurri, N. Leone, and P. Rullo. Enhancing disjunctive datalog by constraints. IEEE TKDE, 12(5):845\u2013860, 2000.","journal-title":"IEEE TKDE"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.774","volume":"13","author":"A. Cimatti","year":"2000","unstructured":"A. Cimatti and M. Roveri. Conformant planning via symbolic model checking. Journal of Artificial Intelligence Research, 13:305\u2013338, 2000.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/3-540-44957-4_54","volume-title":"Planning under incomplete knowledge","author":"T. Eiter","year":"2000","unstructured":"T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. Planning under incomplete knowledge. In: Proc. CL-2000, pp. 807\u2013821, LNCS 1861, Springer, 2000."},{"key":"16_CR6","unstructured":"T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. A logic programming approach to knowledge-state planning: Semantics and complexity. Technical Report INFSYS RR-1843-01-11, Inst. f. Informationssysteme, TUWien, December 2001."},{"key":"16_CR7","unstructured":"T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. A logic programming approach to knowledge-state planning, II: The DLVK system. Technical Report INFSYS RR-1843-01-12, Inst. f. Informationssysteme, TUWien, December 2001."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"T. Eiter, W. Faber, N. Leone, G. Pfeifer, and A. Polleres. Answer set planning under action costs. Manuscript, 2002.","DOI":"10.1007\/3-540-45757-7_16"},{"key":"16_CR9","unstructured":"E. Ephrati, M. E. Pollack, and M. Mihlstein. A cost-directed planner: Preliminary report. In Proc. AAAI-96, pp. 1223\u20131228. AAAI Press, 1996."},{"key":"16_CR10","unstructured":"W. Faber. Disjunctive Datalog with Strong and Weak Constraints: Representational and Computational Issues. Master\u2019s thesis, Inst. f. Informationssysteme, TUWien, 1998."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365\u2013385, 1991.","journal-title":"New Generation Computing"},{"key":"16_CR12","unstructured":"E. Giunchiglia. Planning as satisfiability with expressive action languages: Concurrency, constraints and nondeterminism. In Proc. KR 2000, pp. 657\u2013666. Morgan Kaufmann, 2000."},{"key":"16_CR13","unstructured":"E. Giunchiglia and V. Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI\u2019 98, pp. 623\u2013630, AAAI Press, 1998."},{"key":"16_CR14","unstructured":"P. Haslum and H. Geffner. Admissible heuristics for optimal planning. AIPS\u201900, pp. 140\u2013149. AAAI Press, 2000."},{"key":"16_CR15","unstructured":"H. Kautz and J. P. Walser. State-space planning by integer optimization. In AAAI\u201999, pp. 526\u2013533. AAAI Press, 1999."},{"key":"16_CR16","unstructured":"J. Lee and V. Lifschitz. Additive fluents. In Proc. AAAI 2001 Spring Symposium on Answer Set Programming, pp. 116\u2013123, AAAI Press, 2001."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"V. Lifschitz and H. Turner. Representing transition systems by logic programs. LPNMR\u201999, pp. 92\u2013106.","DOI":"10.1007\/3-540-46767-X_7"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"V. Lifschitz. Answer set planning. ICLP\u201999, pp. 23\u201337. MIT Press, 1999.","DOI":"10.1007\/3-540-46767-X_28"},{"key":"16_CR19","unstructured":"N. McCain and H. Turner. Satisfiability planning with causal theories. KR\u201998, pp. 212\u2013223. Morgan Kaufmann, 1998."},{"key":"16_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-45612-0_4","volume-title":"Beyond the plan-length criterion","author":"A. Nareyek","year":"2001","unstructured":"A. Nareyek. Beyond the plan-length criterion. In Local Search for Planning and Scheduling, ECAI 2000 Workshop, LNCS 2148, pp. 55\u201378. Springer, 2001."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45757-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T18:08:04Z","timestamp":1556906884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45757-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441908","9783540457572"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45757-7_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}