Parallel Abductive Query Answering in Probabilistic Logic Programs
Abstract
Action-probabilistic logic programs ( ap -programs) are a class of probabilistic logic programs that have been extensively used 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 are interested in trying to change the environment, subject to some constraints, so that the probability that entity E takes some action (or combination of actions) is maximized. This is called the Basic Abductive Query Answering Problem (BAQA). We first formally define and study the complexity of BAQA, and then go on to provide an exact (exponential time) algorithm to solve it, followed by more efficient algorithms for specific subclasses of the problem. We also develop appropriate heuristics to solve BAQA efficiently.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Jun 01, 2013
- Source ID
- 10.1145/2480759.2480764
Entities
People
- Amy Sliva
- Gerardo I. Simari
- John P. Dickerson
- V. S. Subrahmanian
Organizations
- Air Force Office of Scientific Research
- Army Research Office
- Division of Social and Economic Sciences
- National Science Foundation
- United States Army Research Laboratory
- University of Maryland