Abstract
We present Version 2 of system Cplus2ASP, which implements the definite fragment of action language \({\cal C}\)+. Its input language is fully compatible with the language of the Causal Calculator Version 2, but the new system is significantly faster thanks to modern answer set solving techniques. The translation implemented in the system is a composition of several recent theoretical results. The system orchestrates a tool chain, consisting of f2lp, clingo, iclingo, and as2transition. Under the incremental execution mode, the system translates a \({\cal C}\)+ description into the input language of iclingo, exploiting its incremental grounding mechanism. The correctness of this execution is justified by the module theorem extended to programs with nested expressions. In addition, the input language of the system has many useful features, such as external atoms by means of Lua calls and the user interactive mode. The system supports extensible multi-modal translations for other action languages, such as \({\cal B}\) and \({\cal BC}\), as well.
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
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153(1-2), 49–104 (2004)
Akman, V., Erdoğan, S., Lee, J., Lifschitz, V., Turner, H.: Representing the Zoo World and the Traffic World in the language of the Causal Calculator. Artificial Intelligence 153(1-2), 105–140 (2004)
Caldiran, O., Haspalamutgil, K., Ok, A., Palaz, C., Erdem, E., Patoglu, V.: Bridging the gap between high-level reasoning and low-level control. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 342–354. Springer, Heidelberg (2009)
Artikis, A., Sergot, M., Pitt, J.: Specifying norm-governed computational societies. ACM Transactions on Computational Logic 9(1) (2009)
Desai, N., Chopra, A.K., Singh, M.P.: Representing and reasoning about commitments in business processes. In: AAAI, pp. 1328–1333 (2007)
Armando, A., Giunchiglia, E., Ponta, S.E.: Formal specification and automatic analysis of business processes under authorization constraints: An action-based approach. In: Fischer-Hübner, S., Lambrinoudakis, C., Pernul, G. (eds.) TrustBus 2009. LNCS, vol. 5695, pp. 63–72. Springer, Heidelberg (2009)
McCain, N.: Causality in Commonsense Reasoning about Actions. PhD thesis, University of Texas at Austin (1997)
Ferraris, P., Lee, J., Lierler, Y., Lifschitz, V., Yang, F.: Representing first-order causal theories by logic programs. TPLP 12(3), 383–412 (2012)
Doğandağ, S., Alpaslan, F.N., Akman, V.: Using stable model semantics (SMODELS) in the Causal Calculator (CCALC). In: Proceedings 10th Turkish Symposium on Artificial Intelligence and Neural Networks, pp. 312–321 (2001)
Gebser, M., Grote, T., Schaub, T.: Coala: A compiler from action languages to ASP. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 360–364. Springer, Heidelberg (2010)
Casolary, M., Lee, J.: Representing the language of the causal calculator in answer set programming. In: ICLP (Technical Communications), pp. 51–61 (2011)
Gelfond, M., Lifschitz, V.: Action languages. Electronic Transactions on Artificial Intelligence 3, 195–210 (1998)
Lee, J., Lifschitz, V., Yang, F.: Action language BC: Preliminary report. In: Proc. IJCAI 2013 (to appear, 2013)
Babb, J., Lee, J.: Module theorem for the general theory of stable models. TPLP 12(4-5), 719–735 (2012)
Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research 35, 813–857 (2009)
Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artificial Intelligence 175, 236–263 (2011)
Lee, J.: Automated Reasoning about Actions. PhD thesis, University of Texas at Austin (2005)
Lee, J., Palla, R.: System f2lp – computing answer sets of first-order formulas. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 515–521. Springer, Heidelberg (2009)
Bartholomew, M., Lee, J.: Stable models of formulas with intensional functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning, KR, pp. 2–12 (2012)
Ferraris, P.: Answer sets for propositional theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)
Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138, 39–54 (2002)
Gebser, M., Grote, T., Kaminski, R., Schaub, T.: Reactive answer set programming. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 54–66. Springer, Heidelberg (2011)
Lee, J., Lifschitz, V.: Describing additive fluents in action language \(\cal C\)+. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI, pp. 1079–1084 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babb, J., Lee, J. (2013). Cplus 2ASP: Computing Action Language \({\cal C}\)+ in Answer Set Programming. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-40564-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40563-1
Online ISBN: 978-3-642-40564-8
eBook Packages: Computer ScienceComputer Science (R0)