Sciweavers

451 search results - page 62 / 91
» Temporal Classes and OWL
Sort
View
IJCAI
1997
15 years 5 months ago
Towards a Complete Classification of Tractability in Allen's Algebra
We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is th...
Thomas Drakengren, Peter Jonsson
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 4 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
IANDC
2006
117views more  IANDC 2006»
15 years 4 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
CN
2004
100views more  CN 2004»
15 years 4 months ago
Study of long-duration MPEG-trace segmentation methods for developing frame-size-based traffic models
Texture and temporal variations in scenes, and peculiarities of MPEG compression algorithms result in very complex frame-size data sets for any long-duration variable bit rate (VB...
Uttam K. Sarkar, Subramanian Ramakrishnan, Dilip S...
LOGCOM
2000
93views more  LOGCOM 2000»
15 years 4 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter