{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:41Z","timestamp":1725565421433},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_28","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"400-415","source":"Crossref","is-referenced-by-count":0,"title":["Adding Domain Dependent Knowledge into Answer Set Programs for Planning"],"prefix":"10.1007","author":[{"given":"Xiumei","family":"Jia","sequence":"first","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]},{"given":"Li Yan","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1,2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0004-3702(99)00071-5","volume":"116","author":"F. Bacchus","year":"2000","unstructured":"Bacchus, F., Kabanza, F.: Using temporal logics to express search control knowledge for planning. Artificial Intelligence\u00a0116(1,2), 123\u2013191 (2000)","journal-title":"Artificial Intelligence"},{"key":"28_CR2","unstructured":"Bacchus, F., Kautz, H., Smith, D.E., Long, D., Geffner, H., Koehler, J.: AIPS 2000 Planning Competition (2000), In http:\/\/www.cs.toronto.edu\/aips2000\/"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. In: Proc. IJCAI 1995, pp. 1636\u20131642 (1995)","DOI":"10.21236\/ADA303260"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-63912-8_84","volume-title":"Recent Advances in AI Planning","author":"Y. Dimopoulos","year":"1997","unstructured":"Dimopoulos, Y., Nebel, B., Keohler, J.: Encoding planning problems in non-monotonic programs. In: Steel, S. (ed.) ECP 1997. LNCS, vol.\u00a01348, pp. 169\u2013181. Springer, Heidelberg (1997)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Doherty, P., Kvarnstom, J.: TALplanner: An empirical investigation of a temporal logicbased forward chaining planner. In: TIME 1999, pp. 47\u201354 (1999)","DOI":"10.1109\/TIME.1999.777971"},{"issue":"1-2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(94)00080-K","volume":"76","author":"K. Erol","year":"1995","unstructured":"Erol, K., Nau, D., Subrahmanian, V.S.: Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence\u00a076(1-2), 75\u201388 (1995)","journal-title":"Artificial Intelligence"},{"key":"28_CR7","unstructured":"Finzi, A., Pirri, F., Reiter, R.: Open world planning in the situation calculus. In: Proc. AAAI 2000, pp. 754\u2013760 (2000)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Frisch, A., Miguel, I., Walsh, T.: CGRASS: A system for transforming constraint satisfaction problems. In: Proc. Joint Workshop of the ERCIM\/CologNet area on Constraint Solving and Constraint Logic Programming, pp. 15\u201330 (2002)","DOI":"10.1007\/3-540-36607-5_2"},{"key":"28_CR9","first-page":"1070","volume-title":"Proc. 5th ICLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"28_CR10","unstructured":"Gent, I.P., Smith, B.M.: Symmetry breaking during search in constraint programming. Research Report 99.02, School of Computer Studies, University of Leeds (1999)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0004-3702(92)90028-V","volume":"56","author":"N. Gupta","year":"1992","unstructured":"Gupta, N., Nau, D.: On the complexity of blocks-world planning. Artificial Intelligence\u00a056, 223\u2013254 (1992)","journal-title":"Artificial Intelligence"},{"key":"28_CR12","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. 10th European Conference on Artificial Intelligence, pp. 359\u2013363 (1992)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Levesque, H.J., Reiter, R., et al.: GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 59\u201383 (1997)","DOI":"10.1016\/S0743-1066(96)00121-5"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/978-3-642-60085-2_16","volume-title":"The Logic Programming Paradigm: A 25-Year Perspective","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Action languages, answer sets and planning. In: Apt, K.R., et al. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 357\u2013371. Springer, Heidelberg (1999)"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V. Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence\u00a0138, 39\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"28_CR16","unstructured":"Miguel, I.: Symmetry-breaking in planning: schematic constraints. In: Proc. CP 2001 Workshop on Symmetry in Constraints (SymCon 2001), pp. 17\u201324 (2001)"},{"key":"28_CR17","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/978-1-4615-1567-8_21","volume-title":"Logic-Based Artificial Intelligence","author":"I. Niemel\u00e4","year":"2000","unstructured":"Niemel\u00e4, I., Simons, P.: Extending the Smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491\u2013521. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"3-4","key":"28_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"28_CR19","unstructured":"Smith, B.: Reducing symmetry in a combinatorial design problem, Research Report 2001.01. Technical report, University of Leeds (2001)"},{"key":"28_CR20","series-title":"Lecture Notes in Artificial Intelligence","first-page":"226","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T.C. Son","year":"2001","unstructured":"Son, T.C., Baral, C., McIlraith, S.: Planning with different forms of domain-dependent control knowledge - an answer set programming approach. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 226\u2013239. Springer, Heidelberg (2001)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Subrahmanian, V.S., Zaniolo, C.: Relating stable models and ai planning domain. In: Proc. ICLP 1995 (1995)","DOI":"10.7551\/mitpress\/4298.003.0030"},{"key":"28_CR22","unstructured":"Van Beek, P., Chen, X.: Cplan: a constraint programming approach to planning. In: Proc. AAAI 1999 (1999)"},{"key":"28_CR23","unstructured":"Wilkins, D., desJardins, M.: A call for knowledge-based planning. AI Magazine\u00a022(1) (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T14:01:54Z","timestamp":1711807314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}