Sciweavers

1391 search results - page 251 / 279
» Completeness of Neighbourhood Logic
Sort
View
CORR
1998
Springer
82views Education» more  CORR 1998»
13 years 9 months ago
Tractability of Theory Patching
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
Shlomo Argamon-Engelson, Moshe Koppel
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 9 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
RML
2002
162views Business» more  RML 2002»
13 years 9 months ago
A Markup Language for ORM Business Rules
Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions...
Jan Demey, Mustafa Jarrar, Robert Meersman
TCS
1998
13 years 9 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
NETWORKS
2007
13 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu