4217 search results - page 762 / 844 » Computational indistinguishability logic |
IANDC
2010
14 years 8 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
118
click to vote
ICFEM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Today’s software systems are becoming increasingly configurable and designed for deployment on a plethora of architectures, ranging from sequential machines via multic...
JAIR
2010
14 years 8 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
JASIS
2010
14 years 8 months ago
2010
The United States Supreme Court case of 1991, Feist Publications, Inc. v. Rural Tel. Service Co., continues to be highly significant for property in data and databases but remains...
MST
2010
14 years 8 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...