Abduction in Annotated Probabilistic Temporal Logic

Cristian Molinaro, Amy Sliva & V. S. Subrahmanian
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...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.