The generalized counting method for recursive logic queries

DOI10.1016/0304-3975(86)90015-0zbMath0658.68118OpenAlexW2163810897WikidataQ127065482 ScholiaQ127065482MaRDI QIDQ1111779

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

logic programmingbindingfixed point computationHorn clauses queriesrecursive query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

The pushdown method to optimize chain logic programs, Testing logic programs for local stratification, Inherent complexity of recursive queries, Well-founded semantics and stratification for ordered logic programs

Cites Work

• Unnamed Item
• A lattice-theoretical fixpoint theorem and its applications
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• A problem-oriented inferential database system
• The Semantics of Predicate Logic as a Programming Language