Abductive inference in probabilistic logic programs

Gerardo I. Simari, V. S. Subrahmanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations


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 Probabilistic Logic Abduction Problem (Basic PLAP). We first formally define and study the complexity of Basic PLAP and then provide an exact (exponential) algorithm to solve it, followed by more efficient algorithms for specific subclasses of the problem. We also develop appropriate heuristics to solve Basic PLAP efficiently.

Original languageEnglish (US)
Title of host publicationTechnical Communications of the 26th International Conference on Logic Programming, ICLP 2010
Number of pages10
StatePublished - 2010
Externally publishedYes
Event26th International Conference on Logic Programming, ICLP 2010 - Edinburgh, United Kingdom
Duration: Jul 16 2010Jul 19 2010

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference26th International Conference on Logic Programming, ICLP 2010
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Abductive inference in probabilistic logic programs'. Together they form a unique fingerprint.

Cite this