{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:45Z","timestamp":1740123885671,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NATO Research Collaborative Grants","award":["CRG951285"],"award-info":[{"award-number":["CRG951285"]}]},{"DOI":"10.13039\/100009224","name":"Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["F30602-95-1-0025"],"award-info":[{"award-number":["F30602-95-1-0025"]}],"id":[{"id":"10.13039\/100009224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["F30602-98-2-0133"],"award-info":[{"award-number":["F30602-98-2-0133"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10472-019-09618-w","type":"journal-article","created":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:47:44Z","timestamp":1554745664000},"page":"641-686","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering state constraints for planning with conditional effects in Discoplan (part I)"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9008-6386","authenticated-orcid":false,"given":"Alfonso Emilio","family":"Gerevini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lenhart","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"key":"9618_CR1","doi-asserted-by":"crossref","unstructured":"Alc\u00e1zari, V., Torralba, A.: A reminder about the importance of computing and exploiting invariants in planning. In: Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, pp 2\u20136 (2015)","DOI":"10.1609\/icaps.v25i1.13708"},{"key":"9618_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1080\/09528139508953799","volume":"7","author":"J Allen","year":"1995","unstructured":"Allen, J., Schubert, L., Ferguson, G., Heeman, P., Hwang, C., Kato, T., Light, M., Martin, N., Miller, B., Poesio, M., Traum, D.: The TRAINS project: a case study in defining a conversational planning agent. J Exp. Theor. AI 7, 7\u201348 (1995)","journal-title":"J Exp. Theor. AI"},{"key":"9618_CR3","doi-asserted-by":"crossref","unstructured":"Asai, M., Fukunaga, A.: Fully automated cyclic planning for large-scale manufacturing domains. In: Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (2014)","DOI":"10.1609\/icaps.v24i1.13620"},{"key":"9618_CR4","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Fraser, C.B.: Inner and outer boundaries of literals: a mechanism for computing domain specific information. In: Working Notes of the AIPS00 Workshop on Analysing and Exploiting Domain Knowledge for Efficient Planning, pp 29\u201336. AAAI Press (2000)","DOI":"10.1007\/978-3-642-60211-5_3"},{"issue":"4","key":"9618_CR5","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","volume":"11","author":"C Bac\u0308kstrom\u0308","year":"1995","unstructured":"Bac\u0308kstrom\u0308, C., Nebel, B.: Complexity results for SAS + planning. Comput. Intell. 11(4), 625\u2013655 (1995)","journal-title":"Comput. Intell."},{"key":"9618_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.01.004","volume":"258","author":"S Bernardini","year":"2018","unstructured":"Bernardini, S., Fagnani, F., Smith, D.E.: Extracting mutual exclusion invariants from lifted temporal planning domains. Artif. Intell. 258, 1\u201365 (2018)","journal-title":"Artif. Intell."},{"key":"9618_CR7","doi-asserted-by":"crossref","unstructured":"Bonet, B., Geffner, H.: Planning as heuristic search: artificial intelligence 129(1\u20132) (2001)","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"9618_CR8","doi-asserted-by":"crossref","unstructured":"Cenk Gazen, B.C.B., Knoblock, C.A.C.A.: Combining the expressiveness of UCPOP with the efficiency of Graphplan. In: Steel, S., Alami, R. (eds.) Recent Advances in AI: Planning: 4th European Conference on Planning, ECP-97. Springer (1997)","DOI":"10.1007\/3-540-63912-8_88"},{"issue":"2","key":"9618_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.artint.2008.11.004","volume":"173","author":"Y Chen","year":"2009","unstructured":"Chen, Y., Huang, R., Xingm, Z., Zhang, W.: Long-distance mutual exclusion for planning. Artif. Intell. 173(2), 365\u2013391 (2009)","journal-title":"Artif. Intell."},{"issue":"1","key":"9618_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/AIC-2010-0473","volume":"24","author":"MC Cooper","year":"2011","unstructured":"Cooper, M.C., de Roquemaurel, M., R\u00e9gnieri, P.: A weighted CSP approach to cost-optimal planning. AI Commun. 24(1), 1\u201329 (2011)","journal-title":"AI Commun."},{"key":"9618_CR11","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press (1990)"},{"key":"9618_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.artint.2014.12.008","volume":"221","author":"C Domshlak","year":"2015","unstructured":"Domshlak, C., Hoffmann, J., Katz, M.: Red-black planning: a new systematic approach to partial delete relaxation. Artif. Intell. 221, 73\u2013114 (2015)","journal-title":"Artif. Intell."},{"key":"9618_CR13","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Helmert, M.: Exhibiting knowledge in planning problems to minimize state encoding length. In: Recent Advances in AI Planning. 5th European Conference on Planning (ECP-99), Volume 1809 of Lecture Notes in Artificial Intelligence, pp 135\u2013147. Springer (1999)","DOI":"10.1007\/10720246_11"},{"key":"9618_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1613\/jair.544","volume":"9","author":"M Fox","year":"1998","unstructured":"Fox, M., Long, D.: The automatic inference of state invariants in TIM. J. Artif. Intell. Res. (JAIR) 9, 367\u2013421 (1998)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9618_CR15","volume-title":"Logical Foundations of Artificial Intelligence","author":"M Genesereth","year":"1987","unstructured":"Genesereth, M, Nilsson, NJ: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Los Altos (1987)"},{"key":"9618_CR16","unstructured":"Gerevini, A., Schubert, L.: Discovering State Constraints for Planning: DISCOPLAN. Technical Report 2005-09-48, Dip. Di Elettronica per l\u2019Automazione, Universit\u00e0 Degli Studi di Brescia, 2005. Revised Version of Technical Report 811, Dept. of Computer Science, University of Rochester (2003)"},{"key":"9618_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1613\/jair.1183","volume":"20","author":"A Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. J. Artif. Intell. Res. (JAIR), 20, 239\u2013290 (2003)","journal-title":"J. Artif. Intell. Res. (JAIR),"},{"key":"9618_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1613\/jair.316","volume":"5","author":"A Gerevini","year":"1996","unstructured":"Gerevini, A., Schubert, L.: Accelerating partial-order planners: some techniques for effective search control and pruning. J. Artif. Intell. Res. (JAIR) 5, 95\u2013137 (1996)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9618_CR19","unstructured":"Gerevini, A., Schubert, L.: Inferring state constraints for domain-independent planning. In: Proceedings of the Fifteenth National Conference of the American Association for Artificial Intelligence (AAAI-98), pp. 905\u2013912. AAAI Press\/The MIT Press (1998)"},{"key":"9618_CR20","unstructured":"Gerevini, A., Schubert, L.: Extending the types of state constraints discovered by discoplan. In: Working Notes of the AIPS00 Workshop on Analysing and Exploiting Domain Knowledge for Efficient Planning, pp. 4\u201311 (2000)"},{"key":"9618_CR21","unstructured":"Gerevini, A., Schubert, L.: Inferring state constraints in discoplan: some new results. In: Proceedings of the Seventeenth National Conference of the American Association for Artificial Intelligence (AAAI-00), pp. 761\u2013767. AAAI Press\/The MIT Press (2000)"},{"key":"9618_CR22","unstructured":"Gerevini, A., Schubert, L.K.: Discoplan: an efficient on-line system for computing planning domain invariants. In: Proceedings of the European Conference on Planning (ECP-01), pp. 284\u2013288. AAAI Press (2014)"},{"key":"9618_CR23","unstructured":"Ghallab, M., Howe, A., Knoblock, G., McDermott, D., Ram, A., Veloso, M., Weld, D., Wilkins, D.: PDDL\u2014planning domain definition language. Technical report. Available at http:\/\/cs-www.cs.yale.edu\/homes\/dvm\/ (1998)"},{"key":"9618_CR24","unstructured":"Haslum, J., Scholz, U.: Domain knowledge in planning representation and use. In: Proceedings of the 13th International Conference on Automated Planning & Scheduling (ICAPS-03), Workshop on PDDL, pp. 69\u201378 (2003)"},{"issue":"5\u20136","key":"9618_CR25","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.artint.2008.10.013","volume":"173","author":"M Helmert","year":"2009","unstructured":"Helmert, M.: Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5\u20136), 503\u2013535 (2009)","journal-title":"Artif. Intell."},{"key":"9618_CR26","unstructured":"Kelleher, G.: Determining general consequences of sets of actions. Technical Report TR CMS.14.96, Liverpool Moores University (1996)"},{"key":"9618_CR27","unstructured":"Kelleher, J., Cohn, A.: Automatically synthesising domain constraints from operator descriptions. In: Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI-92), pp. 653\u2013655. Wiley (1992)"},{"key":"9618_CR28","unstructured":"Kvarnstr\u00f6m, J.: Applying domain analysis techniques for domain-dependent control in Talplanner. In: Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems, pp. 101\u2013111 (2002)"},{"key":"9618_CR29","unstructured":"Lin, F.: Discovering state invariants. In: Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR-04), pp. 536\u2013544. AAAI Press (2004)"},{"key":"9618_CR30","doi-asserted-by":"crossref","unstructured":"Lipovetzkyi, N., Muise, C.J., Geffner, G.: Traps, invariants, and dead-ends. In: Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, pp. 211\u2013215 (2016)","DOI":"10.1609\/icaps.v26i1.13774"},{"key":"9618_CR31","unstructured":"McAllester, D.: Observations on cognitive judgements. In: Proceedings of the Nineth National Conference of the American Association for Artificial Intelligence (AAAI-91), pp. 910\u2013914. MIT Press (1991)"},{"key":"9618_CR32","doi-asserted-by":"crossref","unstructured":"Morris, P., Feldman, R.: Automatically derived heuristics for planning search. In: Proceedings of the Second Irish Conference on AI and Cognitive Science. School of Computer Science Applications, Dublin City University (1989)","DOI":"10.1007\/978-1-4471-3164-9_7"},{"key":"9618_CR33","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1613\/jair.735","volume":"12","author":"B Nebel","year":"2000","unstructured":"Nebel, B.: On the compilability and the expressive power of propositional planning formalisms. J. Artif. Intell. Res. (JAIR) 12, 271\u2013315 (2000)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"9618_CR34","unstructured":"Penberthy, J.S., Weld, D.S.: UCPOP: a sound, complete, partial order planner for ADL. In: Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pp. 103\u2013114. Morgan Kaufmann, Boston (1992)"},{"key":"9618_CR35","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1613\/jair.4697","volume":"53","author":"MF Rankoohi","year":"2015","unstructured":"Rankoohi, M.F., Ghassem-sani, G.: ITSAT: an efficient sat-based temporal planner. J. Artif. Intell. Res. 53, 541\u2013632 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"9618_CR36","unstructured":"Rintanen, J.: A planning algorithm not based on directional search. In: Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pp. 617\u2013624. Morgan Kaufmann (1998)"},{"key":"9618_CR37","unstructured":"Rintanen, J.: An iterative algorithm for synthesizing invariants. In: Proceedings of the Seventeenth National Conference of the American Association for Artificial Intelligence (AAAI-00), pp. 806\u2013811. AAAI Press\/The MIT Press (2000)"},{"key":"9618_CR38","unstructured":"Rintanen, J.: Regression for classical and nondeterministic planning. In: ECAI 2008 - 18th European Conference on Artificial Intelligence, Proceedings, pp. 568\u2013572 (2008)"},{"key":"9618_CR39","doi-asserted-by":"crossref","unstructured":"Rintanen, J.: Constraint-based algorithm for computing temporal invariants. In: Logics in Artificial Intelligence - 14th European Conference, Proceedings, pp. 665\u2013673 (2014)","DOI":"10.1007\/978-3-319-11558-0_50"},{"key":"9618_CR40","doi-asserted-by":"crossref","unstructured":"Rintanen, J.: Schematic invariants by reduction to ground invariants. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 3644\u20133650 (2017)","DOI":"10.1609\/aaai.v31i1.11030"},{"key":"9618_CR41","unstructured":"Scholz, U.: Extracting state constraints from PDDL-like planning domains. In: Working Notes of the AIPS00 Workshop on Analyzing and Exploiting Domain Knowledge for Efficient Planning, pp. 43\u201348. AAAI Press (2000)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09618-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-019-09618-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09618-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T14:22:37Z","timestamp":1694787757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-019-09618-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":41,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["9618"],"URL":"https:\/\/doi.org\/10.1007\/s10472-019-09618-w","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"8 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}