Bottom-up evaluation of Datalog programs with arithmetic constraints

DOI10.1007/3-540-58156-1_22zbMath1433.68083OpenAlexW2096928802MaRDI QIDQ5210782

Marcos Veloso-Peixoto, Laurent Fribourg

Publication date: 21 January 2020

Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58156-1_22

Mathematics Subject Classification ID

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

Related Items (1)

Bottom-up evaluation of Datalog programs with arithmetic constraints

Uses Software

• NQTHM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding repeated elements
• Handling infinite temporal data
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• Pushing constraint selections

This page was built for publication: Bottom-up evaluation of Datalog programs with arithmetic constraints