1144 search results - page 163 / 229 » Logic programming for combinatorial problems |
104
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
100
click to vote
CSL
2004
Springer
15 years 7 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
108
click to vote
ICALT
2003
IEEE
15 years 7 months ago
2003
IEEE
The knowledge society brings its own challenges and demands upon its citizens. Key amongst these is the need to empower people to become lifelong learners, to reflect upon their o...
107
click to vote
SWAP
2008
15 years 3 months ago
2008
The definition of new concepts or roles for which extensional knowledge become available can turn out to be necessary to make a DL ontology evolve. In this paper we reformulate thi...
113
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...