Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...
Pablo Moscato, Luke Mathieson, Alexandre Mendes, R...
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...