3604 search results - page 511 / 721 » Relation rule mining |
175
click to vote
WADT
1997
Springer
15 years 10 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
215
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
197
click to vote
RULES
1993
Springer
15 years 10 months ago
1993
Springer
Semantic models have shown the utility of arbitrary user-de ned relationships for de ning the semantics of database information, while objectoriented models have developed a stron...
170
click to vote
CAISE
2006
Springer
15 years 10 months ago
2006
Springer
Our work deals with schema or ontology matching and is driven by the following statements: (1) Most of works only consider intensional description of schemas; (2) They mostly use s...
154
click to vote
ICLP
1987
Springer
15 years 10 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...