Sciweavers

CONCUR
2011
Springer
12 years 10 months ago
A Spectrum of Behavioral Relations over LTSs on Probability Distributions
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
Silvia Crafa, Francesco Ranzato
LPAR
2010
Springer
13 years 9 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere
APAL
2008
88views more  APAL 2008»
13 years 11 months ago
Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence
Bisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate ...
Ernst-Erich Doberkat
PODS
2008
ACM
152views Database» more  PODS 2008»
14 years 11 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...