scientific article; zbMATH DE number 7760475

DOI10.4230/LIPICS.TIME.2020.5MaRDI QIDQ6060092

A. Passantino, A. Bertagnon, Marco Gavanelli, Guido Sciavicco, Unnamed Author

Publication date: 2 November 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

consistencyconstraint programmingbranching timeHorn fragment

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• An initial study of time complexity in infinite-domain constraint satisfaction
• Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• Fast algebraic methods for interval constraint problems
• Allen-like theory of time for tree-like structures
• ECLⁱPS^e – From LP to CLP
• Reasoning about temporal relations
• Unit Refutations and Horn Sets
• Reasoning about temporal relations
• Allen Linear (Interval) Temporal Logic – Translation to LTL and Monitor Synthesis
• Analysis 1

This page was built for publication: