Games and total Datalog^ queries

DOI10.1016/S0304-3975(99)00222-4MaRDI QIDQ1575136zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

datalogfixpoint logicsgameswell-founded semantics

Mathematics Subject Classification ID

Database theory (68P15)

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

Cites work

• Datalog extensions for database queries and updates
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 850318 (Why is no real title available?)
• Relational queries computable in polynomial time
• The alternating fixpoint of logic programs with negation

Cited in

(2)

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

Describes a project that uses

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)