Abduction in annotated probabilistic temporal logic

Cristian Molinaro; Amy Sliva; V. S. Subrahmanianz

Abduction in annotated probabilistic temporal logic

Cristian Molinaro, Amy Sliva, V. S. Subrahmanianz

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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 K time units after formula F became true with L to U% probability." In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program II, a set of formulas H that can be "added" to II, and a goal G, is there a subset S of H such that II U 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.

Original language	English (US)
Title of host publication	Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011
Pages	240-250
Number of pages	11
State	Published - 2011
Event	27th International Conference on Logic Programming, ICLP 2011 - Lexington, KY, United States Duration: Jul 6 2011 → Jul 10 2011

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	11
ISSN (Print)	1868-8969

Conference

Conference	27th International Conference on Logic Programming, ICLP 2011
Country/Territory	United States
City	Lexington, KY
Period	7/6/11 → 7/10/11

Keywords

Abductive reasoning
Imprecise probabilities
Probabilistic reasoning
Temporal reasoning

ASJC Scopus subject areas

Software

Cite this

@inproceedings{e0ec3acbdb9f4d208a0c1d1f5efd17c9,

title = "Abduction in annotated probabilistic temporal logic",

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 K time units after formula F became true with L to U% probability.{"} In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program II, a set of formulas H that can be {"}added{"} to II, and a goal G, is there a subset S of H such that II U 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.",

keywords = "Abductive reasoning, Imprecise probabilities, Probabilistic reasoning, Temporal reasoning",

author = "Cristian Molinaro and Amy Sliva and Subrahmanianz, {V. S.}",

year = "2011",

language = "English (US)",

isbn = "9783939897316",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

pages = "240--250",

booktitle = "Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011",

note = "27th International Conference on Logic Programming, ICLP 2011 ; Conference date: 06-07-2011 Through 10-07-2011",

}

Molinaro, C, Sliva, A & Subrahmanianz, VS 2011, Abduction in annotated probabilistic temporal logic. in Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011. Leibniz International Proceedings in Informatics, LIPIcs, vol. 11, pp. 240-250, 27th International Conference on Logic Programming, ICLP 2011, Lexington, KY, United States, 7/6/11.

Abduction in annotated probabilistic temporal logic. / Molinaro, Cristian; Sliva, Amy; Subrahmanianz, V. S.
Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011. 2011. p. 240-250 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 11).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Abduction in annotated probabilistic temporal logic

AU - Molinaro, Cristian

AU - Sliva, Amy

AU - Subrahmanianz, V. S.

PY - 2011

Y1 - 2011

N2 - 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 K time units after formula F became true with L to U% probability." In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program II, a set of formulas H that can be "added" to II, and a goal G, is there a subset S of H such that II U 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.

AB - 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 K time units after formula F became true with L to U% probability." In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program II, a set of formulas H that can be "added" to II, and a goal G, is there a subset S of H such that II U 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.

KW - Abductive reasoning

KW - Imprecise probabilities

KW - Probabilistic reasoning

KW - Temporal reasoning

UR - http://www.scopus.com/inward/record.url?scp=84880236876&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880236876&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84880236876

SN - 9783939897316

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 240

EP - 250

BT - Technical Communications of the 27th International Conference on Logic Programming, ICLP 2011

T2 - 27th International Conference on Logic Programming, ICLP 2011

Y2 - 6 July 2011 through 10 July 2011

ER -

Abduction in annotated probabilistic temporal logic

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this