654 search results - page 45 / 131 » Ordered Sets and Complete Lattices |
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
JAR
2006
13 years 7 months ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
DM
2006
13 years 7 months ago
2006
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
JLP
2008
13 years 7 months ago
2008
Based on a set of criteria and a measuring lattice, we introduce relational measures as generalizations of fuzzy measures. The latter have recently made their way from the interva...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...