Abstract
Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities. Rules in ap-programs have the form “If the environment in which entity E operates satisfies certain conditions, then the probability that E will take some action A is between L and U”. Given an ap-program, we have addressed the problem of deciding if there is a way to change the environment (subject to some constraints) so that the probability that entity E takes some action (or combination of actions) is maximized. In this work we tackle a related problem, in which we are interested in reasoning about the expected reactions of the entity being modeled when the environment is changed. Therefore, rather than merely deciding if there is a way to obtain the desired outcome, we wish to find the best way to do so, given costs of possible outcomes. This is called the Cost-based Query Answering Problem (CBQA). We first formally define and study an exact (intractable) approach to CBQA, and then go on to propose a more efficient algorithm for a specific subclass of ap-programs that builds on past work in a basic version of this problem.
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
Asal, V., Carter, J., Wilkenfeld, J.: Ethnopolitical violence and terrorism in the middle east. In: Hewitt, J., Wilkenfeld, J., Gurr, T. (eds.) Peace and Conflict 2008, Paradigm (2008)
Bellman, R. A markovian decision process. J. Mathematics and Mechanics 6 (1957)
Bonet, J.S.D., Isbell Jr., C.L., Viola, P.A.: MIMIC: Finding optima by estimating probability densities. In: Proceedings of NIPS 1996, pp. 424–430. MIT Press, Cambridge (1996)
Boutilier, C., Dearden, R., Goldszmidt, M.: Stochastic dynamic programming with factored representations. Artificial Intelligence 121(1-2), 49–107 (2000)
Christiansen, H.: Implementing probabilistic abductive logic programming with constraint handling rules. In: Schrijvers, T., Frühwirth, T. (eds.) Constraint Handling Rules. LNCS (LNAI), vol. 5388, pp. 85–118. Springer, Heidelberg (2008)
Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation 87(1/2), 78–128 (1990)
Giles, J.: Can conflict forecasts predict violence hotspots? New Scientist, 2647 (March 2008)
Hailperin, T.: Probability logic. Notre Dame J. Formal Logic 25(3), 198–212 (1984)
Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artif. Intell. 157(1-2), 139–202 (2004)
Khuller, S., Martinez, M.V., Nau, D.S., Sliva, A., Simari, G.I., Subrahmanian, V.S.: Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. AMAI 52(2-4), 295–331 (2007)
Littman, M.L.: Algorithms for Sequential Decision Making. PhD thesis, Department of Computer Science, Brown University, Providence, RI (February 1996)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Mannes, A., Michael, M., Pate, A., Sliva, A., Subrahmanian, V.S., Wilkenfeld, J.: Stochastic opponent modelling agents: A case study with Hezbollah. In: Liu, H., Salerno, J. (eds.) Proceedings of IWSCBMP (2008)
Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992)
Ng, R.T., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. J. Autom. Reas. 10(2), 191–235 (1993)
Nilsson, N.: Probabilistic logic. Artificial Intelligence 28, 71–87 (1986)
Pelikan, M., Goldberg, D.E., Lobo, F.G.: A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 21(1), 5–20 (2002)
Poole, D.: Probabilistic horn abduction and bayesian networks. Artif. Intell. 64(1), 81–129 (1993)
Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94(1-2), 7–56 (1997)
Puterman, M.L.: Markov decision processes: Discrete stochastic dynamic programming. John Wiley & Sons, Inc., Chichester (1994)
Simari, G.I., Subrahmanian, V.S.: Abductive inference in probabilistic logic programs. In: Proceedings of ICLP 2010 (Tech. Comm.) (to appear, 2010)
Tseng, P.: Solving H-horizon, stationary Markov decision problems in time proportional to log(H). Operations Research Letters 9(5), 287–297 (1990)
Tsitsiklis, J., van Roy, B.: Feature-based methods for large scale dynamic programming. Machine Learning 22(1/2/3), 59–94 (1996)
Williams, R., Baird, L.: Tight performance bounds on greedy policies based on imperfect value functions. In: 10th Yale Workshop on Adaptive and Learning Systems (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simari, G.I., Dickerson, J.P., Subrahmanian, V.S. (2010). Cost-Based Query Answering in Action Probabilistic Logic Programs. In: Deshpande, A., Hunter, A. (eds) Scalable Uncertainty Management. SUM 2010. Lecture Notes in Computer Science(), vol 6379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15951-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-15951-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15950-3
Online ISBN: 978-3-642-15951-0
eBook Packages: Computer ScienceComputer Science (R0)