The Community for Technology Leaders
Green Image
Issue No. 02 - March/April (1999 vol. 11)
ISSN: 1041-4347
pp: 265-283
<p><b>Abstract</b>—Dynamic programming is a general technique for solving optimization problems. It is based on the division of problems into simpler subproblems that can be computed separately. In this paper, we show that Datalog with aggregates and other nonmonotonic constructs can express classical dynamic programming optimization problems in a natural fashion, and then we discuss the important classes of queries and applications that benefit from these techniques.</p>
Deductive databases, nonmonotonic reasoning, aggregates, optimization.
Sergio Greco, "Dynamic Programming in Datalog with Aggregates", IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. , pp. 265-283, March/April 1999, doi:10.1109/69.761663
220 ms
(Ver 3.3 (11022016))