The expressive power of revised Datalog on problems with closure properties

DOI10.1007/978-3-031-45558-2_9MaRDI QIDQ6562535

Shiguang Feng

Publication date: 26 June 2024

zbMATH Keywords

expressive powerDatalogclosure propertypreservation theorem

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Number of quantifiers is better than number of tape cells
• Datalog extensions for database queries and updates
• An analysis of fixed-point queries on binary trees
• Datalog vs first-order logic
• On datalog vs polynomial time
• Complexity and undecidability results for logic programming
• On Datalog vs. LFP
• Finite Model Theory
• Datalog with Negation and Monotonicity.

This page was built for publication: The expressive power of revised Datalog on problems with closure properties

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