@conference {17746,
	title = {Abduction in Annotated Probabilistic Temporal Logic},
	booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP{\textquoteright}11)},
	series = {Leibniz International Proceedings in Informatics (LIPIcs)},
	volume = {11},
	year = {2011},
	month = {2011///},
	pages = {240 - 250},
	publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
	organization = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
	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 {\textquoteleft}{\textquoteleft}formula G becomes true K time units after formula F became true with L to U\% probability.{\textquoteright}{\textquoteright} In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Pi, a set of formulas H that can be {\textquoteleft}{\textquoteleft}added{\textquoteright}{\textquoteright} to Pi, and a goal G, is there a subset S of H such that Pi \cup S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.},
	isbn = {978-3-939897-31-6},
	doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.240},
	author = {Molinaro,Cristian and Sliva,Amy and V.S. Subrahmanian}
}
