Sciweavers

402 search results - page 64 / 81
» Model Checking Quantified Computation Tree Logic
Sort
View
CAV
2007
Springer
86views Hardware» more  CAV 2007»
15 years 3 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
LATA
2009
Springer
15 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
102
Voted
SEMWEB
2009
Springer
15 years 2 months ago
Reasoning With Provenance, Trust and all that other Meta Knowlege in OWL
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
Simon Schenk, Renata Queiroz Dividino, Steffen Sta...
RTA
2005
Springer
15 years 3 months ago
Natural Narrowing for General Term Rewriting Systems
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
Santiago Escobar, José Meseguer, Prasanna T...
CMSB
2010
Springer
14 years 4 months ago
Action-based analysis of discrete regulatory networks with short-term stimuli
To incorporate instant effects and different timescales within a single biological system, an extension of discrete regulatory networks with short-term stimuli is proposed. By mai...
Christian Krause, Carola Krause, Erik P. de Vink