Computer Science – Artificial Intelligence
Scientific paper
2006-01-11
Computer Science
Artificial Intelligence
30 pages, 5 figures
Scientific paper
The goal of this paper is to provide a strong integration between constraint modelling and relational DBMSs. To this end we propose extensions of standard query languages such as relational algebra and SQL, by adding constraint modelling capabilities to them. In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems. Non-determinism is introduced by means of a guessing operator, which declares a set of relations to have an arbitrary extension. This new operator results in languages with higher expressive power, able to express all problems in the complexity class NP. Some syntactical restrictions which make data complexity polynomial are shown. The effectiveness of both extensions is demonstrated by means of several examples. The current implementation, written in Java using local search techniques, is described. To appear in Theory and Practice of Logic Programming (TPLP)
Cadoli Marco
Mancini Toni
No associations
LandOfFree
Combining Relational Algebra, SQL, Constraint Modelling, and Local Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Combining Relational Algebra, SQL, Constraint Modelling, and Local Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining Relational Algebra, SQL, Constraint Modelling, and Local Search will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-568865