Sciweavers

279 search results - page 36 / 56
» Timed Temporal Logics for Abstracting Transient States
Sort
View
CADE
2010
Springer
14 years 11 months ago
Optimized Description Logic Reasoning via Core Blocking
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
Birte Glimm, Ian Horrocks, Boris Motik
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
15 years 3 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...
QEST
2010
IEEE
14 years 8 months ago
Reasoning about MDPs as Transformers of Probability Distributions
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
Vijay Anand Korthikanti, Mahesh Viswanathan, Gul A...
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
15 years 4 months ago
Bounded Synthesis
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
Sven Schewe, Bernd Finkbeiner
ACRI
2004
Springer
15 years 2 months ago
Characterizing Configuration Spaces of Simple Threshold Cellular Automata
We study herewith the simple threshold cellular automata (CA), as perhaps the simplest broad class of CA with non-additive (i.e., non-linear and non-affine) local update rules. We ...
Predrag T. Tosic, Gul Agha