Abstract
A dynamic domain consists of a set of legal states and a transition function that maps states to states. AI formalisms for specifying dynamic domains have so far focused on describing the effects of actions, that is, the transition functions. In this paper we propose a notion of characteristic set of position systems for the purpose of describing legal states. A position system for a type of objects is a set of properties that are mutually exclusive, and that in each state, every object of the type must satisfy exactly one of these properties called its position under the position system. A set of position systems, one for each type of objects in the domain, is characteristic if there is a one-to-one mapping between legal states and sets of objects’ positions under these position systems. These position systems are useful for reasoning about these dynamic systems including planning. In particular, we show that once we have characteristic sets of position systems for a dynamic domain, planning can be done by writing rules about when to move objects from one position to another.
Similar content being viewed by others
References
Bacchus, F. (2001). AIPS’00 planning competition. AI Magazine 22(3), 47–56. see also in: http://www.cs.toronto.edu/aips2000.
Bacchus, F., & Kabanza, F. (2000). Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116 (1), 123–191.
Carbonell, J., Etzioni, O., Gil, Y., Joseph, R., Knoblock, C., Minton, S., Veloso, M. (1991). PRODIGY: an integrated architecture for planning and learning. ACM SIGART Bulletin, 2 (4), 51–55.
Cook, S.A., & Liu, Y. (2003). A complete axiomatization for blocks world. Journal of Logic and Computation, 13 (4), 581–594.
Doherty, P., & Kvarnstram, J. (2001). TALplanner: a temporal logic-based planner. AI Magazine, 22 (3), 95–102.
Etzioni, O. (1993). Acquiring search-control knowledge via static analysis. Artificial Intelligence, 62 (2), 255–301.
Fikes, R.E., & Nilsson, N.J. (1972). STRIPS: a new approach to the application of theorem proving to problem solving. Artificial intelligence, 2 (3), 189–208.
Finger, J.J. (1987). Exploiting constraints in design synthesis (Ph.D. Thesis). Department of Computer Science, Stanford University (No. STAN-CS-88-1204).
Gelfond, M., & Lifschitz, V. (1999). Action languages. Electronic Transactions on Artificial Intelligence, 2, 193–210.
Ginsberg, M.L., & Smith, D.E. (1988). Reasoning about action I: a possible worlds approach. Artificial intelligence, 35 (2), 165–195.
Ginsberg, M.L., & Smith, D.E. (1988). Reasoning about action II: the qualification problem. Artificial Intelligence, 35 (3), 311–342.
Giunchiglia, E., & Lifschitz V. (1998). An action language based on causal explanation: preliminary report. In J. Mostow, C. Rich (Eds.), Proceedings of the 15th national conference on artificial intelligence and 10th innovative applications of artificial intelligence conference (AAAI 1998/IAAI 1998) (pp. 623–630). Madison: AAAI Press/ The MIT Press.
Herzig, A., & Varzinczak, I. (2007). Metatheory of actions: beyond consistency. Artificial Intelligence, 171 (16), 951–984.
Huang, Y.C., Selman, B., Kautz, H. (2000). Learning declarative control rules for constraint-based planning. In P. Langley (Ed.), Proceedings of the 17th international conference on machine learning (ICML 2000) (pp. 415–422). Stanford University, Stanford: Morgan Kaufmann.
Kowalski, R., & Sergot, M. (1986). A logic-based calculus of events. New Generation Computing, 4 (1), 67–95.
Lin, F. (1995). Embracing causality in specifying the indeterminate effects of actions. In W.J. Clancey, D.S. Weld (Eds.), Proceedings of the 30th national conference on artificial intelligence and 8th innovative applications of artificial intelligence conference (AAAI 1996/ IAAI 1996) (pp. 670–676). Portland: AAAI Press/ The MIT Press.
Lin, F. (2004). Discovering state invariants. In D. Dubois, C.A. Welty, M. Williams (Eds.), Proceedings of the 9th international conference on principles of knowledge representation and reasoning (KR2004) (pp. 536–544). Whistler: AAAI Press.
Lin, F. (2011). On moving objects in dynamic domains. In: Logical formalizations of commonsense reasoning, papers from the 2011 AAAI Spring symposium, TechnicalReportSS-11-06. Stanford: AAAI Press. http://www.aaai.org/ocs/index.php/SSS/SSS11/paper/view/2409.
Lin, F., & Reiter, R. (1994). State constraints revisited. Journal of Logic and Computation, Special Issue on Actions and Processes, 4 (5), 655–677.
McCain, N., & Turner, H. (1995). A causal theory of ramifications and qualifications. In Proceedings of the 14th international joint conference on artificial intelligence (IJCAI 1995) (pp. 1978–1984). Montréal Québec: Morgan Kaufmann.
McCarthy, J. (1963). Situations, actions, and causal laws. In M. Minsky (Ed.), Semantic information processing (pp. 410–417). Cambridge, Mass: MIT Press.
McDermott, D., Ghallab, M., Howe, A., Knoblock, C., Ram, A., Veloso, M., Weld, D., Wilkins, D. (1998). PDDL–the planning domain definition language. AIPS98 Planning Committee, 78(4), 1–27.
Reiter, R. (2001). Knowledge in action: logical foundations for specifying and implementing dynamical systems. Cambridge: MIT Press.
Russel, S., & Norvig, P. (2003). Artificial intelligence: a modern approach, 2nd Edn. Prentice Hall.
Thielscher, M. (1995). Computing ramifications by post-processing. In Proceedings of the 14th international joint conference on artificial intelligence (IJCAI 1995) (pp. 1994–2000). Montréal Québec: Morgan Kaufmann.
Thielscher, M. (1998). Introduction to the fluent calculus. Electronic Transactions on Artificial Intelligence, 2 (3-4), 179–192.
Thielscher, M. (2011). A unifying action calculus. Artificial Intelligence, 175 (1), 120–141.
Tu, P.H., Son, T.C., Gelfond, M., Morales, A.R. (2011). Approximation of action theories and its application to conformant planning. Artificial Intelligence, 175 (1), 79–119.
Zhang, D., Chopra, S., Foo, N.Y. (2002). Consistency of action descriptions. In M. Ishizuka, A. Sattar (Eds.), Proceedings of the 7th Pacific Rim international conference on artificial intelligence (PRICAI 2002): trends in artificial intelligence, lecture notes in computer science (Vol. 2417, pp. 70–79). Tokyo: Springer.
Zhang, Y., & Foo, N.Y. (1997). Deriving invariants and constraints from action theories. Fundamenta Informaticae, 30 (1), 109–123.
Acknowledgements
This work grew out of an earlier work on moving objects [18], and we thank Ning Ding, Maonian Wu, and Haodi Zhang for useful discussions. This work was supported in part by HK RGC under GRF 616013.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ji, J., Lin, F. Position Systems in Dynamic Domains. J Philos Logic 44, 147–161 (2015). https://doi.org/10.1007/s10992-014-9331-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10992-014-9331-9