Sciweavers

5924 search results - page 3 / 1185
» Normal Process Representatives
Sort
View
NFM
2011
225views Formal Methods» more  NFM 2011»
13 years 1 months ago
Synthesis for PCTL in Parametric Markov Decision Processes
Abstract. In parametric Markov Decision Processes (PMDPs), transition probabilities are not fixed, but are given as functions over a set of parameters. A PMDP denotes a family of ...
Ernst Moritz Hahn, Tingting Han, Lijun Zhang
FUIN
2008
56views more  FUIN 2008»
13 years 6 months ago
Representing Uncertainty in RuleML
The RuleML initiative defines a normalized markup for expressing and exchange rules in the Semantic Web. However, the syntax of the language is still limited and lacks features for...
Carlos Viegas Damásio, Jeff Z. Pan, Giorgos...
JAIR
2006
106views more  JAIR 2006»
13 years 6 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
CORR
2000
Springer
88views Education» more  CORR 2000»
13 years 6 months ago
The lexicographic closure as a revision process
The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e...
Richard Booth
CCA
2005
Springer
13 years 11 months ago
Representing Probability Measures using Probabilistic Processes
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
Matthias Schröder, Alex K. Simpson