162 search results - page 22 / 33 » Completeness Guarantees for Incomplete Reasoners |
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
TCS
2010
14 years 8 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
123
click to vote
ICDT
2009
ACM
14 years 7 months ago
2009
ACM
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
An XML-to-relational mapping scheme consists of a procedure for shredding XML documents into relational databases, a procedure for publishing databases back as documents, and a se...