Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way

DOI10.1016/j.ic.2020.104637OpenAlexW3095010045MaRDI QIDQ821554

Romeo Rizzi, Luca Viganò, Matteo Zavatteri, Carlo Combi

Publication date: 21 September 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2020.104637

zbMATH Keywords

temporal constraintsaccess controldisjunctive temporal networkHSCC algorithmsincremental SAT-solvingsimple temporal network with decisions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU) ⋮ Dynamic controllability of temporal networks with instantaneous reaction ⋮ Mining CSTNUDs significant for a set of traces is polynomial

Uses Software

• MiniSat
• Sat4j

Cites Work

• Unnamed Item
• Unnamed Item
• SAT race 2015
• Maximising the weighted number of activity execution modes in project planning
• Temporal constraint networks
• Backtracking algorithms for disjunctions of temporal constraints
• Temporal representation and reasoning in artificial intelligence: Issues and approaches
• CTP: A new constraint-based formalism for conditional, temporal planning
• Conditional simple temporal networks with uncertainty and decisions
• Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
• Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty.
• Conditional Simple Temporal Networks with Uncertainty and Resources

This page was built for publication: Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way