Abstract
Reasoning about Action and Change (RAC) and Answer Set Programming (ASP) are two well-known fields in AI for logic-based reasoning. Each paradigm bears unique features and a possible integration can lead to more effective ways to address hard AI problems. In this paper, we report on implementations that embed RAC formalisms and concepts in ASP and present the experimental results obtained, building on a graph-based problem setting that introduces casual and temporal requirements.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann (2004)
Reiter, R.: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press (2001)
Kowalski, R., Sergot, M.: A Logic-based Calculus of Events. New Generation Computing 4(1), 67–95 (1986)
Miller, R., Shanahan, M.: Some alternative formulations of the event calculus. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 452–490. Springer, Heidelberg (2002)
Lifschitz, V.: What is answer set programming? In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 1594–1597. AAAI (2008)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: International Logic Programming Conference and Symposium, pp. 1070–1080 (1988)
Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artificial Intelligence 175(1), 236–263 (2011)
Denecker, M., Vennekens, J., Vlaeminck, H., Wittocx, J., Bruynooghe, M.: Answer set programming’s contributions to classical logic. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 12–32. Springer, Heidelberg (2011)
Kumar, T.S., Cirillo, M., Koenig, S.: On the traveling salesman problem with simple temporal constraints. In: 10th Symposium of Abstraction, Reformulation, and Approximation (SARA 2013), pp. 73–79 (2013)
Mueller, E.: Commonsense Reasoning, 1st edn. Morgan Kaufmann (2006)
Miller, R., Morgenstern, L., Patkos, T.: Reasoning about knowledge and action in an epistemic event calculus. In: 11th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2013 (2013)
Eiter, T., Ianni, G., Krennwallner, T.: Reasoning web. semantic technologies for information systems, 40–110 (2009)
Coban, E., Erdem, E., Ture, F.: Comparing ASP, CP, ILP on two Challenging Applications: Wire Routing and Haplotype Inference. In: Proc. of the 2nd International Workshop on Logic and Search, LaSh 2008 (2008)
Kim, T.-W., Lee, J., Palla, R.: Circumscriptive event calculus as answer set programming. In: 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 823–829 (2009)
Celik, M., Erdogan, H., Tahaoglu, F., Uras, T., Erdem, E.: Comparing ASP and CP on four grid puzzles. In: Proc. of the 16th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2009 (2009)
Tran, N., Baral, C.: Reasoning about Triggered Actions in AnsProlog and Its Application to Molecular Interactions in Cells. In: 9th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2004), pp. 554–564 (2004)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. In: Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2012)
Lee, J., Palla, R.: Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming. Journal of Artificial Intelligence Research 43(1), 571–620 (2012)
Ma, J., Miller, R., Morgenstern, L., Patkos, T.: An epistemic event calculus for asp-based reasoning about knowledge of the past, present and future. In: Proc. of the 19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-19 (2013)
Erdem, E., Aker, E., Patoglu, V.: Answer set programming for collaborative housekeeping robotics: Representation, reasoning, and execution. Intelligent Service Robotics 5(4), 275–291 (2012)
Aker, E., Erdogan, A., Erdem, E., Patoglu, V.: Causal reasoning for planning and coordination of multiple housekeeping robots. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 311–316. Springer, Heidelberg (2011)
Chittaro, L., Montanari, A.: Efficient temporal reasoning in the cached event calculus. Computational Intelligence 12(3), 359–382 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Gouidis, F., Patkos, T., Flouris, G., Plexousakis, D. (2014). Declarative Reasoning Approaches for Agent Coordination. In: Likas, A., Blekas, K., Kalles, D. (eds) Artificial Intelligence: Methods and Applications. SETN 2014. Lecture Notes in Computer Science(), vol 8445. Springer, Cham. https://doi.org/10.1007/978-3-319-07064-3_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-07064-3_42
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07063-6
Online ISBN: 978-3-319-07064-3
eBook Packages: Computer ScienceComputer Science (R0)