Cristian Molinaro
Abstract
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true Δt time units after formula F became true with ℓ to u% probability.” In this article, we deal with abductive reasoning in APT logic: given an APT logic program Π, a set of formulas H that can be “added” to Π, and a (temporal) goal g, is there a subset S of H such that Π ∪ S is consistent and entails the goal g? In general, there are many different solutions to the problem and some of them can be highly repetitive, differing only in some unimportant temporal aspects. We propose a compact representation called super-solutions that succinctly represent sets of such solutions. Super-solutions are compact, but lossless representations of sets of such solutions. We study the complexity of existence of basic, super-, and maximal super-solutions as well as check if a set is a solution/super-solution/maximal super-solution. We then leverage a geometric characterization of the problem to suggest a set of pruning strategies and interesting properties that can be leveraged to make the search of basic and super-solutions more efficient. We propose correct sequential algorithms to find solutions and super-solutions. In addition, we develop parallel algorithms to find basic and super-solutions.
- C. Baral. 2000. Abductive reasoning through filtering. Artificial Intelligence 120, 1 (2000), 1--28. Google Scholar
Digital Library
- A. Bezek and M. Gams. 2005. From basic agent behavior to strategic patterns in a robotic soccer domain. Informatica (Slovenia) 29, 4 (2005), 461--468.Google Scholar
- V. Brusoni, L. Console, P. Terenziani, and D. T. Dupré. 1997. An efficient algorithm for temporal abduction. Congress of the Italian Association for Artificial Intelligence (AI*IA) (1997), 195--206. Google ScholarDigital Library
- T. Bylander, D. Allemang, M. C. Tanner, and J. R. Josephson. 1991. The computational complexity of abduction. Artificial Intelligence 49, 1--3 (1991), 25--60. Google ScholarDigital Library
- E. Charniak and R. Goldman. 1991. Probabilistic Abduction for Plan Recognition. Technical Report. Providence, RI. Google ScholarDigital Library
- E. Charniak and R. P. Goldman. 1993. A Bayesian model of plan recognition. Artificial Intelligence 64, 1 (1993), 53--79. Google ScholarDigital Library
- H. Christiansen. 2008. Implementing probabilistic abductive logic programming with constraint handling rules. In Constraint Handling Rules. 85--118. Google ScholarDigital Library
- T. Console, P. Terenziani, and D. T. Dupré. 2002. Local reasoning and knowledge compilation for temporal abduction. IEEE Transactions on Knowledge and Data Engineering 14, 6 (2002), 1230--1248. Google ScholarDigital Library
- M. Denecker, L. Missiaen, and M. Bruynooghe. 1992. Temporal reasoning with abductive event calculus. In European Conference on Artificial Intelligence (ECAI). 384--388. Google ScholarDigital Library
- T. Eiter and G. Gottlob. 1995. The Complexity of Logic-Based Abduction. J. ACM 42, 1 (1995), 3--42. Google ScholarDigital Library
- T. Eiter, G. Gottlob, and N. Leone. 1997. Semantics and complexity of abduction from default theories. Artificial Intelligence 90 (1997), 90--1. Google ScholarDigital Library
- U. Endress, P. Mancarella, F. Sadri, G. Terreni, and F. Toni. 2004. The CIFF proof procedure for abductive logic programming with constraints. Logics in Artificial Intelligence - Journes Europennes sur la Logique en Intelligence Artificielle (JELIA) (2004), 31--43.Google Scholar
- R. Fagin, J. Y. Halpern, and N. Megiddo. 1990. A logic for reasoning about probabilities. Information and Computation 87, 1/2 (1990), 78--128. Google ScholarDigital Library
- N. Fuhr. 1995. Probabilistic Datalog - A Logic For Powerful Retrieval Methods. In International Conference on Research and Development in Information Retrieval (SIGIR). 282--290. Google ScholarDigital Library
- N. Fuhr. 2000. Probabilistic datalog: Implementing logical information retrieval for advanced applications. Journal of the American Society for Information Science 51, 2 (2000), 95--110. Google ScholarDigital Library
- C. W. Geib and R. P. Goldman. 2009. A probabilistic plan recognition algorithm based on plan tree grammars. Artificial Intelligence 173, 11 (2009), 1101--1132. Google ScholarDigital Library
- T. Hailperin. 1984. Probability logic. Notre Dame Journal of Formal Logic 25 (3) (1984), 198--212.Google Scholar
- A. Kakas, R. Kowalski, and F. Toni. 1992. Abductive logic programming. Journal of Logic and Computation 2, 6 (1992), 719--770.Google ScholarCross Ref
- R. J. Kate and R. J. Mooney. 2009. Probabilistic abduction using Markov logic networks. In Proceedings of the IJCAI-09 Workshop on Plan, Activity, and Intent Recognition (PAIR-09). Pasadena, CA.Google Scholar
- J. W. Lloyd. 1987. Foundations of Logic Programming (2nd ed.). Springer. Google ScholarDigital Library
- P. Mancarella, G Terreni, F. Sadri, F. Toni, and U. Endriss. 2009. The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. Theory and Practice of Logic Programming 9, 6 (2009), 691--750. Google ScholarDigital Library
- C. Molinaro, A. Sliva, and V. S. Subrahmanian. 2011. Abduction in annotated probabilistic temporal logic. In International Conference on Logic Programming (ICLP), Technical Communications. 240--250.Google Scholar
- R. T. Ng and V. S. Subrahmanian. 1992. Probabilistic logic programming. Information and Computation 101, 2 (1992), 150--201. Google ScholarDigital Library
- N. J. Nilsson. 1986. Probabilistic Logic. Artificial Intelligence 28, 1 (1986), 71--87. Google ScholarDigital Library
- C. H. Papadimitriou and M. Yannakakis. 1984. The complexity of facets (and some facets of complexity). Journal of Computer System Science 28, 2 (1984), 244--259.Google ScholarCross Ref
- Y. Peng and J. Reggia. 1990. Abductive Inference Models for Diagnostic Problem Solving. Springer-Verlag. Google ScholarDigital Library
- S. Perri, F. Scarcello, and N. Leone. 2005. Abductive logic programs with penalization: Semantics, complexity and implementation. Theory and Practice of Logic Programming 5, 1--2 (2005), 123--159. Google ScholarDigital Library
- D. Poole. 1993. Probabilistic horn abduction and Bayesian networks. Artificial Intelligence 64, 1 (1993), 81--129. Google ScholarDigital Library
- D. Poole. 1997. The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence 94, 1--2 (1997), 7--56. Google ScholarDigital Library
- P. Shakarian, A. Parker, G. I. Simari, and V. S. Subrahmanian. 2011. Annotated Probabilistic Temporal Logic. ACM Transactions on Computational Logic 12, 2 (2011). Google ScholarDigital Library
- P. Shakarian, G. I. Simari, and V. S. Subrahmanian. 2012. Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation. ACM Transactions on Computational Logic 13, 2 (2012), 13. Google ScholarDigital Library
- M. Shanahan. 2000. An abductive event calculus. Journal of Logic Programming 44, 1--3 (2000), 207--240.Google ScholarCross Ref
- G. I. Simari, J. P. Dickerson, A. Sliva, and V. S. Subrahmanian. 2013. Parallel abductive query answering in probabilistic logic programs. ACM Transactions on Computational Logic 14, 2 (2013), 12. Google ScholarDigital Library
- G. I. Simari, J. P. Dickerson, and V. S. Subrahmanian. 2010. Cost-based query answering in action probabilistic logic programs. In International Conference on Scalable Uncertainty Management (SUM). 319--332. Google ScholarDigital Library
- G. I. Simari and V. S. Subrahmanian. 2010. Abductive inference in probabilistic logic programs. In International Conference on Logic Programming (ICLP), Technical Communications. 192--201.Google Scholar
- L. J. Stockmeyer and A. R. Meyer. 1973. Word problems requiring exponential time: Preliminary report. In ACM Symposium on the Theory of Computing (STOC). 1--9. Google ScholarDigital Library
- V. S. Subrahmanian, A. Mannes, J. Shakarian, A. Sliva, and J. Dickerson. 2013. Computational Analysis of Terror Groups: Lashkar-e-Taiba. Springer. Google ScholarDigital Library
Index Terms
- Super-Solutions: Succinctly Representing Solutions in Abductive Annotated Probabilistic Temporal Logic
Recommendations
Annotated probabilistic temporal logic
The semantics of most logics of time and probability is given via a probability distribution over threads, where a thread is a structure specifying what will be true at different points in time (in the future). When assessing the probabilities of ...
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation
Annotated Probabilistic Temporal (APT) logic programs support building applications where we wish to reason about statements of the form “Formula G becomes true with a probability in the range [L, U] within (or in exactly) Δt time units after formula F ...
Logic and Model Checking by Imprecise Probabilistic Interpreted Systems
Multi-Agent SystemsAbstractStochastic multi-agent systems raise the necessity to extend probabilistic model checking to the epistemic domain. Results in this direction have been achieved by epistemic extensions of Probabilistic Computation Tree Logic and related ...
Comments