Greedy algorithms in Datalog

DOI10.1017/S1471068401001090zbMATH Open1066.68572OpenAlexW2170719314MaRDI QIDQ4452635FDOQ4452635

Authors: Sergio Greco, Carlo Zaniolo 

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068401001090

Recommendations

• scientific article; zbMATH DE number 1420817
• Expressing and supporting efficiently greedy algorithms as locally stratified logic programs
• scientific article; zbMATH DE number 1926632
• Relational and Kleene-Algebraic Methods in Computer Science
• A class of greedy algorithms and its relation to greedoids

zbMATH Keywords

query evaluation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (8)

• Title not available (Why is that?)
• Declarative distributed computing
• Extrema predicates in deductive databases
• Expressing and supporting efficiently greedy algorithms as locally stratified logic programs
• Dynamic Programming Algorithms as Products of Weighted Logic Programs
• The Choice Construct in the Soufflé Language
• On acceptance conditions in abstract argumentation frameworks
• \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems

Uses Software

• Datalog

This page was built for publication: Greedy algorithms in Datalog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452635)