2845 search results - page 139 / 569 » Constraints over Ontologies |
170
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
221
click to vote
ESOP
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
154
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice...
185
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
167
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...