Abstract
We investigate the methodology of utilizing domain dependent knowledge in solving the planning problem in answer set programming. We provide a classification of domain dependent knowledge, and for each class, a coding scheme. In this way, domain dependent knowledge can be encoded into an existing program. Experiments are conducted to illustrate the effect of adding domain dependent knowledge for benchmark planning problems, which show that adding domain dependent knowledge in many cases substantially improves the search efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bacchus, F., Kabanza, F.: Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116(1,2), 123–191 (2000)
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/
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. In: Proc. IJCAI 1995, pp. 1636–1642 (1995)
Dimopoulos, Y., Nebel, B., Keohler, J.: Encoding planning problems in non-monotonic programs. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 169–181. Springer, Heidelberg (1997)
Doherty, P., Kvarnstom, J.: TALplanner: An empirical investigation of a temporal logicbased forward chaining planner. In: TIME 1999, pp. 47–54 (1999)
Erol, K., Nau, D., Subrahmanian, V.S.: Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76(1-2), 75–88 (1995)
Finzi, A., Pirri, F., Reiter, R.: Open world planning in the situation calculus. In: Proc. AAAI 2000, pp. 754–760 (2000)
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–30 (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)
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)
Gupta, N., Nau, D.: On the complexity of blocks-world planning. Artificial Intelligence 56, 223–254 (1992)
Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. 10th European Conference on Artificial Intelligence, pp. 359–363 (1992)
Levesque, H.J., Reiter, R., et al.: GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 59–83 (1997)
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–371. Springer, Heidelberg (1999)
Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138, 39–54 (2002)
Miguel, I.: Symmetry-breaking in planning: schematic constraints. In: Proc. CP 2001 Workshop on Symmetry in Constraints (SymCon 2001), pp. 17–24 (2001)
Niemelä, I., Simons, P.: Extending the Smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491–521. Kluwer Academic Publishers, Dordrecht (2000)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence 25(3-4), 241–273 (1999)
Smith, B.: Reducing symmetry in a combinatorial design problem, Research Report 2001.01. Technical report, University of Leeds (2001)
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ński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 226–239. Springer, Heidelberg (2001)
Subrahmanian, V.S., Zaniolo, C.: Relating stable models and ai planning domain. In: Proc. ICLP 1995 (1995)
Van Beek, P., Chen, X.: Cplan: a constraint programming approach to planning. In: Proc. AAAI 1999 (1999)
Wilkins, D., desJardins, M.: A call for knowledge-based planning. AI Magazine 22(1) (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jia, X., You, JH., Yuan, L.Y. (2004). Adding Domain Dependent Knowledge into Answer Set Programs for Planning. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive