×

Hybrid answer set programming. (English) Zbl 1344.68041

Summary: This paper discusses an extension of Answer Set Programming (ASP) called Hybrid Answer Set Programming (H-ASP) which allows the user to reason about dynamical systems that exhibit both discrete and continuous aspects. The unique feature of Hybrid ASP is that it allows the use of ASP type rules as controls for when to apply algorithms to advance the system to the next position. That is, if the prerequisites of a rule are satisfied and the constraints of the rule are not violated, then the algorithm associated with the rule is invoked.

MSC:

68N17 Logic programming
03B70 Logic in computer science
68T27 Logic in artificial intelligence
68T30 Knowledge representation
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Altman, E., Applications of Markov decision processes in communication networks: A survey (2000), Rapport de Recherche-Institute National de Recherche en Informatique et en Automatique
[2] Baral, Chitta; Gelfond, Michael; Rushton, J. Nelson, Probabilistic reasoning with answer sets, Theory Pract. Log. Program., 9, 1, 57-144 (2009) · Zbl 1170.68003
[3] Bellman, R., Dynamic Programming (1957), Princeton University Press · Zbl 0077.13605
[4] Brik, Alex, Extensions of answer set programming (2012), University of California: University of California San Diego, Ph.D. thesis · Zbl 1245.68046
[5] Brik, Alex; Remmel, Jeffrey B., Hybrid ASP, (Gallagher, John P.; Gelfond, Michael, ICLP (Technical Communications). ICLP (Technical Communications), LIPIcs, vol. 11 (2011), Schloss Dagstuhl - Leibniz-Zentrum für Informatik), 40-50 · Zbl 1245.68047
[6] Brik, Alex; Remmel, Jeffrey B., Computing a finite horizon optimal strategy using hybrid ASP, (Proceeding of the 14th International Workshop on Non-Monotonic Reasoning (2012))
[7] Chintabathina, Sandeep; Gelfond, Michael; Watson, Richard, Modeling hybrid domains using process description language, (De Vos, Marina; Provetti, Alessandro, Answer Set Programming. Answer Set Programming, CEUR Workshop Proceedings, vol. 142 (2005), CEUR-WS.org)
[8] Gebser, Martin; Ostrowski, Max; Schaub, Torsten, Constrain answer set solving, (ICLP (2009)), 235-249 · Zbl 1251.68061
[9] Gelfond, Michael; Lifschitz, Vladimir, The stable model semantics for logic programming, (ICLP/SLP (1988)), 1070-1080
[10] Gelfond, Michael; Lifschitz, Vladimir, Action languages, Electron. Trans. on Artif. Intell., 2, 193-210 (1998)
[11] George, D. L.; LeVeque, R. J., Finite volume methods and adaptive refinement for global tsunami propagation and local inundation, Sci. Tsunami Hazards, 24, 319-328 (2006)
[12] Inciezan, Daniela, Modular action language \(ALM\) for dynamic domain representation (2012), Texas Tech. Univ., Ph.D. thesis
[13] Jachec, S. M.; Fringer, O. B.; Gerritsen, M. G.; Street, R. L., Numerical simulation of internal tides and the resulting energetics within Monterey Bay and the surrounding area, Geophys. Res. Lett., 33 (2006)
[14] Kerckhoffs, Roy; Neal, Maxwell; Gu, Quan; Bassingthwaighte, James; Omens, Jeff; McCulloch, Andrew, Coupling of a 3d finite element model of cardiac ventricular mechanics to lumped systems models of the systemic and pulmonic circulation, Ann. Biomed. Eng., 35, 1-18 (2007)
[15] Mallarkod, Veena S.; Gelfond, Michael; Zhang, Yualin, Integrating answer set programming and constraint logic programming, Ann. Math. Artif. Intell., 53, 1-4, 251-287 (2008) · Zbl 1165.68504
[16] Mundhenk, Martin; Goldsmith, Judy; Lusena, Christopher; Allender, Eric, Complexity of finite-horizon Markov decision process problems, J. ACM, 47, 4, 681-720 (2000) · Zbl 1327.68136
[17] Papadimitriou, Christos H.; Tsitsiklis, John N., The complexity of Markov decision processes, Math. Oper. Res., 12, 3, 441-450 (1987) · Zbl 0638.90099
[18] Puterman, M. L., Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley Series in Probability and Statistics (1994), Wiley-Interscience · Zbl 0829.90134
[19] Reiter, Raymond, Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems (September 2001), The MIT Press, illustrated edition
[20] Saad, Emad, A logical framework to reinforcement learning using hybrid probabilistic logic programs, (Greco, Sergio; Lukasiewicz, Thomas, SUM. SUM, Lecture Notes in Computer Science, vol. 5291 (2008), Springer), 341-355
[21] Saad, Emad; Pontelli, Enrico, A new approach to hybrid probabilistic logic programs, Ann. Math. Artif. Intell., 48, 3-4, 187-243 (2006) · Zbl 1118.68673
[22] Strehl, Alexander L.; Li, Lihong; Littman, Michael L., Reinforcement learning in finite MDPs: PAC analysis, J. Mach. Learn. Res., 10, 2413-2444 (2009) · Zbl 1235.68193
[23] Trench, Margaret S.; Pederson, Shane P.; Lau, Edward T.; Ma, Lizhi; Wang, Hui; Nair, Suresh K., Managing credit lines and prices for bank one credit cards, Interfaces, 33, 4-21 (2003)
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.