284 search results - page 4 / 57 » Modularity of Completeness Revisited |
RTA
1991
Springer
14 years 1 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
DLOG
2010
13 years 7 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
ISER
2000
Springer
14 years 1 months ago
2000
Springer
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
ICALP
1997
Springer
14 years 1 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...