zbMATH — the first resource for mathematics

Modular action language \(\mathcal{ALM}\). (English) Zbl 1379.68297
Summary: The paper introduces a new modular action language, \(\mathcal{ALM}\), and illustrates the methodology of its use. It is based on the approach of M. Gelfond and V. Lifschitz [J. Log. Program. 17, No. 2–4, 301–321 (1993; Zbl 0783.68024); “Action languages”, Electron. Trans. AI 3, No. 16, 193–210 (1998)] in which a high-level action language is used as a front end for a logic programming system description. The resulting logic programming representation is used to perform various computational tasks. The methodology based on existing action languages works well for small and even medium size systems, but is not meant to deal with larger systems that require structuring of knowledge. \(\mathcal{ALM}\) is meant to remedy this problem. Structuring of knowledge in \(\mathcal{ALM}\) is supported by the concepts of module (a formal description of a specific piece of knowledge packaged as a unit), module hierarchy, and library, and by the division of a system description of \(\mathcal{ALM}\) into two parts: theory and structure. A theory consists of one or more modules with a common theme, possibly organized into a module hierarchy based on a dependency relation. It contains declarations of sorts, attributes, and properties of the domain together with axioms describing them. Structures are used to describe the domain’s objects. These features, together with the means for defining classes of a domain as special cases of previously defined ones, facilitate the stepwise development, testing, and readability of a knowledge base, as well as the creation of knowledge representation libraries.

68T27 Logic in artificial intelligence
68N17 Logic programming
68T30 Knowledge representation
Smodels; ALM; CCalc; oClingo
Full Text: DOI
[1] Akman, V.; Erdogan, S. T.; 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) · Zbl 1085.68679
[2] Balai, E.; Gelfond, M.; Zhang, Y.; Fink, M.; Lierler, Y., (2012)
[3] Balduccini, M.; Jayaraman, B., Proc. PADL’04, USA-smart: Improving the quality of plans in answer set planning, 135-147, (2004), Springer: Springer, Berlin
[4] Balduccini, M.; Baral, C.; Brewka, G.; Schlipf, J. S., Proc. of LPNMR-07, CR-MODELS: An inference engine for CR-prolog, 18-30, (2007), Springer: Springer, Berlin · Zbl 1149.68325
[5] Balduccini, M., ASP with non-Herbrand partial functions: A language and system for practical use, Theory and Practice of Logic Programming, 13, 4-5, 547-561, (2013) · Zbl 1286.68039
[6] Balduccini, M.; Gelfond, M., Diagnostic reasoning with A-prolog, Theory and Practice of Logic Programming, 3, 425-461, (2003) · Zbl 1079.68094
[7] Balduccini, M.; Gelfond, M.; Doherty, P.; Mccarthy, J.; Williams, M.-A., International Symposium on Logical Formalization of Commonsense Reasoning, Logic programs with consistency-restoring rules, 9-18, (2003), AAAI 2003 Spring Symposium Series: AAAI 2003 Spring Symposium Series, Palo Alto, CA
[8] Balduccini, M.; Gelfond, M.; Fink, M.; Lierler, Y., (2012)
[9] Baral, C., Knowledge Representation, Reasoning, and Declarative Problem Solving, (2003), Cambridge University Press · Zbl 1056.68139
[10] Baral, C.; Dzifcak, J.; Takahashi, H.; Etalle, S.; Truszczyski, M., Logic Programming, Macros, macro calls and use of ensembles in modular answer set programming, 376-390, (2006), Springer: Springer, Berlin Heidelberg · Zbl 1130.68008
[11] Baral, C.; Gelfond, M., Reasoning Agents in Dynamic Domains, 257-279, (2000), Kluwer Academic Publishers: Kluwer Academic Publishers, Norwell, MA · Zbl 0979.68100
[12] Bartholomew, M.; Lee, J., On the stable model semantics for intensional functions, Journal of Theory and Practice of Logic Programming (TPLP), 13, 4-5, 863-876, (2013) · Zbl 1286.68041
[13] Blount, J.; Gelfond, M.; Balduccini, M.; Sridharan, M.; Yang, F.; Ramamoorthy, S.; Patoglu, V.; Erdem, E., AAAI 2014 Spring Symposium Series, Towards a theory of intentional agents, (2014), AAAI Press: AAAI Press, Palo Alto, CA
[14] Cabalar, P., Functional answer set programming, Journal of Theory and Practice of Logic Programming (TPLP), 11, 2-3, 203-233, (2011) · Zbl 1220.68033
[15] Calimeri, F.; Ianni, G., Template programs for disjunctive logic programming: An operational semantics, AI Communications, 19, 3, 193-206, (2006) · Zbl 1104.68009
[16] Chintabathina, S., Planning and scheduling in hybrid domains, Frontiers in Artificial Intelligence and Applications, 241, 59-70, (2012)
[17] Chintabathina, S.; Gelfond, M.; Watson, R.; De Vos, M.; Provetti, A., Proc. of ASP ’05 Answer Set Programming: Advances in Theory and Implementation, Modeling hybrid domains using process description language, 303-317, (2005), CEUR-WS
[18] Desai, N.; Singh, M. P., Proc. of the 22nd AAAI Conference on Artificial Intelligence, July 22-26, 2007, Vancouver, British Columbia, Canada, A modular action description language for protocol composition, 962-967, (2007), AAAI Press: AAAI Press, Palo Alto, CA
[19] Dovier, A.; Formisano, A.; Pontelli, E., Multivalued action languages with constraints in CLP(FD), Logic Programming: Lecture Notes in Computer Science, 4670, 255-270, (2007) · Zbl 1213.68633
[20] Eiter, T.; Erdem, E.; Fink, M.; Senko, J., Updating action domain descriptions, Artif. Intell., 174, 1172-1221, (2010) · Zbl 1225.68251
[21] Eiter, T.; Faber, W.; Leone, N.; Pfeifer, G.; Polleres, A., Approach to knowledge-state planning: Semantics and complexity, ACM Transactions on Computational Logic, 5, 206-263, (2004) · Zbl 1367.68301
[22] Eiter, T.; Ianni, G.; Lukasiewicz, T.; Schindlauer, R.; Tompits, H., Combining answer set programming with description logics for the semantic web, Artificial Intelligence, 172, 12-13, 1495-1539, (2008) · Zbl 1183.68595
[23] Erdogan, S.; Lifschitz, V.; Doherty, P.; Mylopoulos, J.; Welty, C. A., Principles of Knowledge Representation and Reasoning: Proceedings of the International Conference, Actions as special cases, 377-387, (2006), AAAI Press: AAAI Press, Palo Alto, CA
[24] Erdogan, S. T., (2008)
[25] Fodor, P.; Kifer, M.; Gallagher, J. P.; Gelfond, M., Proc. of the 27th International Conference on Logic Programming (ICLP), Modeling hybrid domains using process description language, 162-174, (2011), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Wadern
[26] Gebser, M.; Grote, T.; Kaminski, R.; Schaub, T.; Delgrande, J. P.; Faber, W., LPNMR, Reactive answer set programming, 54-66, (2011), Springer: Springer, Berlin · Zbl 1327.68063
[27] Gebser, M.; Kaminski, R.; Kaufmann, B.; Schaub, T., Answer Set Solving in Practice, (2012), Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers
[28] Gebser, M.; Sabuncu, O.; Schaub, T., An incremental answer set programming based system for finite model computation, AI Commun., 24, 2, 195-212, (2011) · Zbl 1215.68209
[29] Gelfond, M.; Inclezan, D., (2009)
[30] Gelfond, M.; Inclezan, D., Some properties of system descriptions in ALd, Journal of Applied Non-Classical Logics, 23, 105-120, (2013) · Zbl 1400.68207
[31] Gelfond, M.; Kahl, Y., Knowledge Representation, Reasoning, and the Design of Intelligent Agents, (2014), Cambridge University Press
[32] Gelfond, M.; Lifschitz, V.; Kowalski, R. A.; Bowen, K. A., Proc. of ICLP-88, The stable model semantics for logic programming, 1070-1080, (1988), MIT Press: MIT Press, Cambridge, MA
[33] Gelfond, M.; Lifschitz, V., Classical negation in logic programs and disjunctive databases, New Generation Computing, 9, 3-4, 365-386, (1991) · Zbl 0735.68012
[34] Gelfond, M.; Lifschitz, V., Representing action and change by logic programs, Journal of Logic Programming, 17, 2-4, 301-321, (1993) · Zbl 0783.68024
[35] Gelfond, M.; Lifschitz, V., Action languages, Electronic Transactions on AI, 3, 16, 193-210, (1998)
[36] Giunchiglia, E.; Lee, J.; Lifschitz, V.; Mccain, N.; Turner, H., Nonmonotonic causal theories, Artificial Intelligence, 153, 1-2, 105-140, (2004) · Zbl 1085.68679
[37] Giunchiglia, E.; Lee, J.; Lifschitz, V.; Mccain, N.; Turner, H., Nonmonotonic causal theories, Artificial Intelligence, 153, 105-140, (2004) · Zbl 1085.68679
[38] Giunchiglia, E.; Lifschitz, V.; Mostow, J.; Rich, C., Proc. of National Conference on Artificial Intelligence (AAAI), An action language based on causal explanation: Preliminary report, 623-630, (1998), AAAI Press: AAAI Press, Palo Alto, CA
[39] Grosof, B.; Dean, M.; Kifer, M., (2009)
[40] Gunning, D.; Chaudhri, V. K.; Clark, P.; Barker, K.; Chaw, S.-Y.; Greaves, M.; Grosof, B.; Leung, A.; Mcdonald, D.; Mishra, S.; Pacheco, J.; Porter, B.; Spaulding, A.; Tecuci, D.; Tien, J., Project Halo-progress toward digital aristotle, AI Magazine, 31, 3, 33-58, (2010)
[41] Gustafsson, J.; Kvarnstróm, J., Elaboration tolerance through object-orientation, Artificial Intelligence, 153, 239-285, (2004) · Zbl 1085.68683
[42] Hanus, M., The integration of functions into logic programming: From theory to practice, Journal of Logic Programming, 19-20, Supplement 1, 583-628, (1994) · Zbl 0942.68526
[43] Henschel, A.; Thielscher, M., The LMW Traffic world in the fluent calculus, Linkóping Electronic Articles in Computer and Information Science, 5, (2000)
[44] Inclezan, D.; Brewka, G.; Marek, V.; Truszczynski, M., (2010)
[45] Inclezan, D.; Gelfond, M., Proc. of the 2011 AAAI Spring Symposium on Formalizing Commonsense, Representing biological processes in modular action language ALM, 49-55, (2011), AAAI Press: AAAI Press, Palo Alto, CA
[46] Kakas, A.; Miller, R., A simple declarative language for describing narratives with actions, Journal of Logic Programming, 31, 1-3, 157-200, (1997) · Zbl 0880.68009
[47] Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; Scarcello, F., The DLV system for knowledge representation and reasoning, ACM Transactions on Computational Logic, 7, 3, 499-562, (2006) · Zbl 1367.68308
[48] Lierler, Y.; Truszczynski, M., Proc. of the 27th AAAI Conference on Artificial Intelligence (AAAI-13), Modular answer set solving, 68-70, (2013), AAAI Press: AAAI Press, Palo Alto, CA
[49] Lifschitz, V.; Brewka, G.; Eiter, T.; Mcilraith, S. A., Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR), Logic programs with intensional functions, 24-31, (2012), AAAI Press: AAAI Press, Palo Alto, CA
[50] Lifschitz, V.; Ren, W., Proc. of the 21st National Conference on Artificial Intelligence (AAAI), A modular action description language, 853-859, (2006), AAAI Press: AAAI Press, Palo Alto, CA
[51] Marek, V. W.; Truszczynski, M., The Logic Programming Paradigm: A 25-Year Perspective, Stable models and an alternative logic programming paradigm, 375-398, (1999), Springer: Springer, Verlag, Berlin · Zbl 0979.68524
[52] Mccarthy, J., (1963)
[53] Mccarthy, J., Semantic Information Processing, Programs with common sense, 403-418, (1968), MIT Press
[54] Mccarthy, J., (1998)
[55] Niemelä, I., Logic programs with stable model semantics as a constraint programming paradigm, Annals of Mathematics and Artificial Intelligence, 25, 72-79, (1998)
[56] Niemelä, I.; Simons, P.; Dix, J.; Furbach, U.; Nerode, A., Proc. of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-97), Smodels - an implementation of the stable model and well-founded semantics for normal logic programs, 420-429, (1997), Springer: Springer, Berlin
[57] Oikarinen, E.; Janhunen, T.; Brewka, G.; Coradeschi, S.; Perini, A.; Traverso, P., Proceedings of 17th European Conference on Artificial Intelligence(ECAI), Modular equivalence for normal logic programs, 412-416, (2006), IOS Press: IOS Press, Amsterdam
[58] Pfenning, F., Types in Logic Programming, (1992), MIT Press
[59] Sandewall, E., (1999)
[60] Strass, H.; Thielscher, M.; Erdem, E.; Lee, J.; Lierler, Y.; Pearce, D., Correct Reasoning: Essays in Honor of Vladimir Lifschitz, A language for default reasoning about actions, 527-542, (2012), Springer · Zbl 1241.68016
[61] Turner, H., Representing actions in logic programs and default theories: A situation calculus approach, Journal of Logic Programming, 31, 1-3, 245-298, (1997) · Zbl 0880.68010
[62] Turner, H., A logic of universal causation, Artificial Intelligence, 113, 87-123, (1999) · Zbl 0940.03031
[63] Van Gelder, A.; Ross, K. A.; Schlipf, J. S., The well-founded semantics for general logic programs, Journal of the ACM, 38, 619-649, (1991) · Zbl 0799.68045
[64] Wirth, N., Program development by stepwise refinement, Communications of the ACM, 14, 4, 221-227, (1971) · Zbl 0214.43005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.