A new polynomial-time algorithm for linear programming
Combinatorica
Artificial Intelligence
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Probabilistic logic programming
Information and Computation
A logic for reasoning with inconsistency
Journal of Automated Reasoning
On the hardness of approximate reasoning
Artificial Intelligence
Temporal probabilistic logic programs
Proceedings of the 1999 international conference on Logic programming
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic Situation Calculus
Annals of Mathematics and Artificial Intelligence
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
"Sometimes" and "Not Never" Revisited: on Branching Versus Linear Time
"Sometimes" and "Not Never" Revisited: on Branching Versus Linear Time
ACM SIGKDD Explorations Newsletter
Combining probabilistic logic programming with the power of maximum entropy
Artificial Intelligence - Special issue on nonmonotonic reasoning
Heterogeneous temporal probabilistic agents
ACM Transactions on Computational Logic (TOCL)
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
PRISM: probabilistic model checking for performance and reliability analysis
ACM SIGMETRICS Performance Evaluation Review
Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty
International Journal of Approximate Reasoning
Annotated probabilistic temporal logic
ACM Transactions on Computational Logic (TOCL)
Revisiting the semantics of interval probabilistic logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Hi-index | 0.00 |
Annotated Probabilistic Temporal (APT) logic programs support building applications where we wish to reason about statements of the form “Formula G becomes true with a probability in the range [L, U] within (or in exactly) Δt time units after formula F became true.” In this paper, we present a sound, but incomplete fixpoint operator that can be used to check consistency and entailment in APT logic programs. We present the first implementation of APT-logic programs and evaluate both its compute time and convergence on a suite of 23 ground APT-logic programs that were automatically learned from two real-world data sets. In both cases, the APT-logic programs contained up to 1,000 ground rules. In one data set, entailment problems were solved on average in under 0.1 seconds per ground rule, while in the other, it took up to 1.3 seconds per ground rule. Consistency was also checked in a reasonable amount of time. When discussing entailment of APT-logic formulas, convergence of the fixpoint operator refers to (U − L) being below a certain threshold. We show that on virtually all of the 23 automatically generated APT-logic programs, convergence was quick---often in just 2-3 iterations of the fixpoint operator. Thus, our implementation is a practical first step towards checking consistency and entailment in temporal probabilistic logics without independence or Markovian assumptions.