81 search results - page 4 / 17 » Approximating module semantics with constraints |
AGP
1994
IEEE
13 years 10 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
AAAI
2007
13 years 8 months ago
2007
We present the syntax and semantics of a modular ontology language SHOIQP to support context-specific reuse of knowledge from multiple ontologies. A SHOIQP ontology consists of m...
VLDB
2001
ACM
14 years 6 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
RANLP
2003
13 years 7 months ago
2003
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
APSEC
2005
IEEE
13 years 12 months ago
2005
IEEE
We present a new set of metrics for analyzing the interaction between the modules of a large software system. We believe that these metrics will be important to any automatic or s...