Abduction in Annotated Probabilistic Temporal Logic

Molinaro, Cristian; Sliva, Amy; Subrahmanian, V. S.

doi:10.4230/LIPIcs.ICLP.2011.240

Document

Abduction in Annotated Probabilistic Temporal Logic

Authors Cristian Molinaro, Amy Sliva, V. S. Subrahmanian

Part of: Volume: Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (ICLP 2011)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Logic Programming (ICLP)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2011-06-27

PDF

File

PDF

LIPIcs.ICLP.2011.240.pdf

Filesize: 0.53 MB
11 pages

Document Identifiers

DOI: 10.4230/LIPIcs.ICLP.2011.240
URN: urn:nbn:de:0030-drops-31697

Subject Classification

Keywords

Probabilistic Reasoning
Imprecise Probabilities
Temporal Reasoning
Abductive Reasoning

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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 Pi, a set of formulas H that can be ``added'' 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.

Cite As Get BibTex

Cristian Molinaro, Amy Sliva, and V. S. Subrahmanian. Abduction in Annotated Probabilistic Temporal Logic. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 240-250, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011) https://doi.org/10.4230/LIPIcs.ICLP.2011.240

Author Details

Cristian Molinaro

Amy Sliva

V. S. Subrahmanian

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail