A fast algorithm and datalog inexpressibility for temporal reasoning

DOI10.1145/1740582.1740583zbMath1351.68051arXiv0805.1473OpenAlexW2123815839MaRDI QIDQ2946603

Manuel Bodirsky, Jan Kára

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

algorithmscomputational complexityprecedence constraintstemporal reasoningconstraint satisfactionDatalogOrd-Horn

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (4)

Relation algebras of Sugihara, Belnap, Meyer, and Church ⋮ Constants and finite unary relations in qualitative constraint reasoning ⋮ Tractability of quantified temporal constraints to the max ⋮ Schaefer's Theorem for Graphs

Uses Software

• Datalog

This page was built for publication: A fast algorithm and datalog inexpressibility for temporal reasoning