Eliminating Recursion from Monadic Datalog Programs on Trees

DOI10.1007/978-3-662-48057-1_31zbMath1465.68039arXiv1505.02444OpenAlexW1900847447MaRDI QIDQ2946356

Joanna Ochremiak, Adam Witkowski, Filip Mazowiecki

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02444

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Uses Software

• Datalog

Cites Work

• Decidable containment of recursive queries
• Data independent recursion in deductive databases
• Monadic Datalog and Regular Tree Pattern Queries
• Undecidable boundedness problems for datalog programs
• Undecidable optimization problems for database logic programs
• Monadic Datalog Containment
• A simple characterization of uniform boundedness for a class of recursions
• Containment of Monadic Datalog Programs via Bounded Clique-Width
• Optimizing Conjunctive Queries over Trees Using Schema Information
• Unnamed Item
• Unnamed Item

This page was built for publication: Eliminating Recursion from Monadic Datalog Programs on Trees