Querying datalog programs with temporal logic

DOI10.1007/BF01191723zbMath0790.68033OpenAlexW3121709727MaRDI QIDQ1323325

Alexander Tuzhilin

Publication date: 4 July 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01191723

zbMATH Keywords

temporal logicfixpoint logicdatalog programssemantics of datalog query

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Artificial intelligence (68T99) Logic programming (68N17)

Related Items (1)

Querying datalog programs with temporal logic

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-point extensions of first-order logic
• Datalog extensions for database queries and updates
• Why not negation by fixpoint?
• Elementary induction on abstract structures
• Querying datalog programs with temporal logic

This page was built for publication: Querying datalog programs with temporal logic