Computer Science – Logic in Computer Science
Scientific paper
2007-06-05
LMCS 3 (3:3) 2007
Computer Science
Logic in Computer Science
43 pages
Scientific paper
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem for the system of probabilistic ITL with respect to an abstract semantics and a relative completeness theorem for the system of probabilistic DC with respect to real-time semantics. The proposed systems subsume probabilistic real-time DC as known from the literature. A correspondence between the proposed systems and a system of probabilistic interval temporal logic with finite intervals and expanding modalities is established too.
No associations
LandOfFree
Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-122679