Games and total Datalog^ queries

DOI10.1016/S0304-3975(99)00222-4zbMATH Open0947.68046OpenAlexW2117344057MaRDI QIDQ1575136FDOQ1575136

Authors: M. Kubierschky, Jörg Flum, Bertram Ludäscher 

Publication date: 21 August 2000

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00222-4

Recommendations

• On the expressive power of Datalog: tools and a case study.
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• Why not negation by fixpoint?
• The well-founded semantics for general logic programs

zbMATH Keywords

gameswell-founded semanticsdatalogfixpoint logics

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• The alternating fixpoint of logic programs with negation
• Datalog extensions for database queries and updates
• Title not available (Why is that?)
• Relational queries computable in polynomial time
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• Title not available (Why is that?)

Cited In (1)

• An Ehrenfeucht-Fraïssé game approach to collapse results in database theory

Uses Software

• Datalog

This page was built for publication: Games and total Datalog\(^{\lnot}\) queries

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