Greedy Algorithms in Datalog

Details Greedy Algorithms in Datalog Greedy Algorithms in Datalog

2003-12-18

arxiv.org/abs/cs/0312041v1

Theory and Practice of Logic Programming, 1(4): 381-407, 2001

Computer Science

Databases

27 pages

Scientific paper

In the design of algorithms, the greedy paradigm provides a powerful tool for solving efficiently classical computational problems, within the framework of procedural languages. However, expressing these algorithms within the declarative framework of logic-based languages has proven a difficult research challenge. In this paper, we extend the framework of Datalog-like languages to obtain simple declarative formulations for such problems, and propose effective implementation techniques to ensure computational complexities comparable to those of procedural formulations. These advances are achieved through the use of the "choice" construct, extended with preference annotations to effect the selection of alternative stable-models and nondeterministic fixpoints. We show that, with suitable storage structures, the differential fixpoint computation of our programs matches the complexity of procedural algorithms in classical search and optimization problems.

Affiliated with

Also associated with

No associations

Rating

Greedy Algorithms in Datalog 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 Greedy Algorithms in Datalog, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Algorithms in Datalog will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307954