A closed form for datalog queries with integer order

DOI10.1007/3-540-53507-1_77MaRDI QIDQ4694689zbMATH OpenFDO

Authors P. Z. Revesz

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

database languagesdatalog queriesinteger order constraintslogic programmingsubsumption

Mathematics Subject Classification ID

Logic programming (68N17) Information storage and retrieval of data (68P20)

Recommendations

• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• Datalog: A self-contained tutorial. II
• The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
• Datalog with integer periodicity constraints
• DATALOG and constraints

Cited in

(11)

• Subsumtion and indexing in constraint query languages with linear arithmetic constraints.
• The complexity of query evaluation in indefinite temporal constraint databases
• Finitely representable databases
• Memoing evaluation for constraint extensions of datalog
• The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
• Datalog with integer periodicity constraints
• DATALOG and constraints
• Bottom-up evaluation of Datalog programs with arithmetic constraints
• Querying logical databases
• Well-structured transition systems everywhere!
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: A closed form for datalog queries with integer order

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