193 search results - page 26 / 39 » Automated Reasoning in Kleene Algebra |
161
click to vote
DLOG
2009
15 years 4 months ago
2009
We report on event recognition within the life logging application IYOUIT for the automatic creation of static diary-like Blogs. Based on the qualitative context histories produced...
160
click to vote
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
140
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
136
click to vote
ECSQARU
2009
Springer
16 years 22 days ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
128
click to vote
LICS
2006
IEEE
16 years 5 days ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...