{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:37:55Z","timestamp":1777559875163,"version":"3.51.4"},"reference-count":32,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIC"],"published-print":{"date-parts":[[2016,4,26]]},"DOI":"10.3233\/aic-150692","type":"journal-article","created":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T16:05:59Z","timestamp":1461686759000},"page":"435-467","source":"Crossref","is-referenced-by-count":2,"title":["Compiling irrelevant objects to counters. Special case of creation planning"],"prefix":"10.1177","volume":"29","author":[{"given":"Raquel","family":"Fuentetaja","sequence":"first","affiliation":[{"name":"Departamento de Inform\u00e1tica, Universidad Carlos III de Madrid, Av. Universidad 30, Legan\u00e9s, Madrid, Spain. E-mails:\u00a0rfuentet@inf.uc3m.es,\u00a0trosa@inf.uc3m.es"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1s","family":"de la Rosa","sequence":"additional","affiliation":[{"name":"Departamento de Inform\u00e1tica, Universidad Carlos III de Madrid, Av. Universidad 30, Legan\u00e9s, Madrid, Spain. E-mails:\u00a0rfuentet@inf.uc3m.es,\u00a0trosa@inf.uc3m.es"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"4","key":"10.3233\/AIC-150692_ref1","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1111\/j.1467-8640.1995.tb00052.x","article-title":"Complexity results for SAS+ planning","volume":"11","author":"Backstrom","year":"1995","journal-title":"Computational Intelligence"},{"key":"10.3233\/AIC-150692_ref2","unstructured":"B.\u00a0Bonet, P.\u00a0Haslum, S.\u00a0Hickmott and S.\u00a0Thi\u00e9baux, Planning via Petri net unfolding: Generalisation and improvements, in: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2007."},{"key":"10.3233\/AIC-150692_ref3","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1613\/jair.1696","article-title":"Macro-ff: Improving AI planning with automatically learned macro-operators","volume":"24","author":"Botea","year":"2005","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1,2","key":"10.3233\/AIC-150692_ref4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","article-title":"The computational complexity of propositional strips planning","volume":"69","author":"Bylander","year":"1994","journal-title":"Artificial Intelligence (AI)"},{"key":"10.3233\/AIC-150692_ref5","unstructured":"L.\u00a0Chrpa and T.L.\u00a0McCluskey, On exploiting structures of classical planning problems: Generalizing entanglements, in: Proceedings of the ECAI, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0242, IOS Press, 2012, pp.\u00a0240\u2013245."},{"key":"10.3233\/AIC-150692_ref6","unstructured":"R.\u00a0Dechter, Constraint Processing, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003."},{"key":"10.3233\/AIC-150692_ref7","doi-asserted-by":"crossref","unstructured":"C.\u00a0Domshlak, M.\u00a0Katz and A.\u00a0Shleyfman, Enhanced symmetry breaking in cost-optimal planning as forward search, in: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), L.\u00a0McCluskey, B.\u00a0Williams, J.R.\u00a0Silva and B.\u00a0Bonet, eds, 2012.","DOI":"10.1609\/icaps.v22i1.13531"},{"key":"10.3233\/AIC-150692_ref8","first-page":"317","article-title":"The automatic inference of state invariants in tim","volume":"9","author":"Fox","year":"1998","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150692_ref9","unstructured":"M.\u00a0Fox and D.\u00a0Long, The detection and exploitation of symmetry in planning problems, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1999."},{"key":"10.3233\/AIC-150692_ref10","unstructured":"M.\u00a0Fox and D.\u00a0Long, Extending the exploitation of symmetries in planning, in: Proceedings of the Artificial Intelligence Planning Systems Conference (AIPS), M.\u00a0Ghallab, J.\u00a0Hertzberg and P.\u00a0Traverso, eds, AAAI, 2002, pp.\u00a083\u201391."},{"key":"10.3233\/AIC-150692_ref11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.dam.2013.08.008","article-title":"On the subgraph epimorphism problem","volume":"162","author":"Gay","year":"2014","journal-title":"Discrete Applied Mathematics"},{"key":"10.3233\/AIC-150692_ref12","doi-asserted-by":"crossref","unstructured":"H.\u00a0Geffner, Functional strips: A more flexible language for planning and problem solving, in: Logic-Based Artificial Intelligence, Kluwer, 2000.","DOI":"10.1007\/978-1-4615-1567-8_9"},{"key":"10.3233\/AIC-150692_ref13","unstructured":"P.\u00a0Haslum, Reducing accidental complexity in planning problems, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), M.\u00a0Veloso, ed., 2007, pp.\u00a01898\u20131903."},{"key":"10.3233\/AIC-150692_ref14","doi-asserted-by":"crossref","unstructured":"P.\u00a0Haslum, M.\u00a0Helmert and A.\u00a0Jonsson, Safe, strong, and tractable relevance analysis for planning, in: Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS), 2013.","DOI":"10.1609\/icaps.v23i1.13601"},{"key":"10.3233\/AIC-150692_ref15","unstructured":"P.\u00a0Haslum and U.\u00a0Scholz, Domain knowledge in planning: Representation and use, in: Proceedings of the ICAPS 2003 Workshop on PDDL, 2003."},{"key":"10.3233\/AIC-150692_ref16","unstructured":"M.\u00a0Helmert, A planning heuristic based on causal graph analysis, in: Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), 2004, pp.\u00a0161\u2013170."},{"key":"10.3233\/AIC-150692_ref17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","article-title":"The Fast Downward planning system","volume":"26","author":"Helmert","year":"2006","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150692_ref19","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.artint.2008.10.013","article-title":"Concise finite-domain representations for pddl planning tasks","volume":"173","author":"Helmert","year":"2009","journal-title":"Artificial Intelligence (AI)"},{"key":"10.3233\/AIC-150692_ref20","doi-asserted-by":"crossref","unstructured":"M.\u00a0Helmert, P.\u00a0Haslum, J.\u00a0Hoffmann and R.\u00a0Nissim, Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces, Journal of the ACM 61(3) (2014), 16.","DOI":"10.1145\/2559951"},{"key":"10.3233\/AIC-150692_ref21","unstructured":"S.\u00a0Hickmott, J.\u00a0Rintanen, S.\u00a0Thi\u00e9baux and L.\u00a0White, Planning via Petri net unfolding, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2007."},{"key":"10.3233\/AIC-150692_ref22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1613\/jair.1144","article-title":"The metric-ff planning system: Translating \u201cignoring delete lists\u201d to numeric state variables","volume":"20","author":"Hoffmann","year":"2003","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150692_ref23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","article-title":"The ff planning system: Fast plan generation through heuristic search","volume":"14","author":"Hoffmann","year":"2001","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"2","key":"10.3233\/AIC-150692_ref24","doi-asserted-by":"crossref","first-page":"12","DOI":"10.4018\/jdm.2000040102","article-title":"Binary equivalents of ternary relationships in entity-relationship modeling: A logical decomposition approach","volume":"11","author":"Jones","year":"2000","journal-title":"Journal of Database Management (JDM)"},{"key":"10.3233\/AIC-150692_ref25","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1613\/jair.2857","article-title":"Soft goals can be compiled away","volume":"36","author":"Keyder","year":"2009","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150692_ref26","unstructured":"J.\u00a0Koehler and J.\u00a0Hoffmann, Handling of inertia in planning systems, in: ECAI-2000 Workshop on New Trends in Planning, Scheduling and Design, 2000."},{"key":"10.3233\/AIC-150692_ref28","doi-asserted-by":"crossref","unstructured":"D.\u00a0Long, M.\u00a0Fox and M.\u00a0Hamdi, Reformulation in planning, in: Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation (SARA), Lecture Notes in Artificial Intelligence, Vol.\u00a02371, Springer, 2002, pp.\u00a018\u201332.","DOI":"10.1007\/3-540-45622-8_2"},{"key":"10.3233\/AIC-150692_ref29","doi-asserted-by":"crossref","unstructured":"B.\u00a0Nebel, Y.\u00a0Dimopoulos and J.\u00a0Koehler, Ignoring irrelevant facts and operators in plan generation, in: Proceedings of the European Conference on Planning (ECP), 1997, pp.\u00a0338\u2013350.","DOI":"10.1007\/3-540-63912-8_97"},{"key":"10.3233\/AIC-150692_ref30","doi-asserted-by":"crossref","unstructured":"N.\u00a0Pochter, A.\u00a0Zohar and J.\u00a0Rosenschein, Exploiting problem symmetries in state-based planners, in: Proceedings of the AAAI Conference on Artificial Intelligence, 2011.","DOI":"10.1609\/aaai.v25i1.8014"},{"key":"10.3233\/AIC-150692_ref31","unstructured":"S.\u00a0Richter, M.\u00a0Helmert and M.\u00a0Westphal, Landmarks revisited, in: Proceedings of the 23rd AAAI Conference on Artificial Intelligence, 2008, pp.\u00a0975\u2013982."},{"key":"10.3233\/AIC-150692_ref32","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","article-title":"The lama planner: Guiding cost-based anytime planning with landmarks","volume":"39","author":"Richter","year":"2010","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150692_ref33","unstructured":"P.J.\u00a0Riddle, R.C.\u00a0Holte and M.W.\u00a0Barley, Does representation matter in the planning competition? in: Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA), M.R.\u00a0Genesereth and P.Z.\u00a0Revesz, eds, AAAI, 2011."},{"key":"10.3233\/AIC-150692_ref34","doi-asserted-by":"crossref","unstructured":"K.\u00a0Talamadupula, J.\u00a0Benton, S.\u00a0Kambhampati, P.\u00a0Schermerhorn and M.\u00a0Scheutz, Planning for human\u2013robot teaming in open worlds, ACM Transactions on Intelligent Systems and Technology (TIST) 1(2) (2010), 14.","DOI":"10.1145\/1869397.1869403"}],"container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-150692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T18:27:26Z","timestamp":1777400846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/AIC-150692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,26]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/aic-150692","relation":{},"ISSN":["1875-8452","0921-7126"],"issn-type":[{"value":"1875-8452","type":"electronic"},{"value":"0921-7126","type":"print"}],"subject":[],"published":{"date-parts":[[2016,4,26]]}}}