Sciweavers

1353 search results - page 153 / 271
» Streamlined Constraint Reasoning
Sort
View
FSTTCS
2006
Springer
15 years 1 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...
IJCAI
1989
14 years 11 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
CORR
2010
Springer
106views Education» more  CORR 2010»
14 years 10 months ago
Spatial logics with connectedness predicates
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter...
AI
2002
Springer
14 years 10 months ago
Relaxed Unification - Proposal
Abstract. The traditional unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can co...
Tony Abou-Assaleh, Nick Cercone
ENTCS
2002
99views more  ENTCS 2002»
14 years 9 months ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews