The generalized counting method for recursive logic queries

DOI10.1016/0304-3975(86)90015-0zbMATH Open0658.68118OpenAlexW2163810897WikidataQ127065482 ScholiaQ127065482MaRDI QIDQ1111779FDOQ1111779

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

bindinglogic programmingfixed point computationHorn clauses queriesrecursive query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• A lattice-theoretical fixpoint theorem and its applications
• The Semantics of Predicate Logic as a Programming Language
• Implementation of logical query languages for databases
• Title not available (Why is that?)
• On compiling queries in recursive first-order databases
• A problem-oriented inferential database system

Cited In (5)

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

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)