3758 search results - page 547 / 752 » A Complete Subsumption Algorithm |
128
click to vote
CSR
2009
Springer
15 years 8 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
EMMCVPR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Tracking is usually interpreted as finding an object in single consecutive frames. Regularization is done by enforcing temporal smoothness of appearance, shape and motio...
110
click to vote
ESWS
2009
Springer
15 years 8 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
107
Voted
LPNMR
2009
Springer
15 years 8 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
122
Voted
PPDP
2009
Springer
15 years 8 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...