The generalized counting method for recursive logic queries

DOI10.1016/0304-3975(86)90015-0MaRDI QIDQ1111779zbMATH OpenOpenAlexWikidataFDO

Authors Domenico Saccà, Carlo Zaniolo

Publication date 1988

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90015-0

zbMATH Keywords

bindingfixed point computationHorn clauses querieslogic programmingrecursive query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Review text

See the review of the preliminary version of this article [Database theory, Proc. Int. Conf., Rome/Italy 1986, Lect. Notes Comput. Sci. 243, 31-53 (1986; Zbl 0643.68163)].

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A problem-oriented inferential database system
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• The Semantics of Predicate Logic as a Programming Language

Cited in

(5)

• A counting algorithm for a cyclic binary query
• Testing logic programs for local stratification
• Well-founded semantics and stratification for ordered logic programs
• The pushdown method to optimize chain logic programs
• Inherent complexity of recursive queries

This page was built for publication: The generalized counting method for recursive logic queries

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