On the public citation graph
A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks
0 signed · 38 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11889205_28openalex-snapshot
A Structural Characterization of Temporal Dynamic Controllability
inferredcites →https://doi.org/10.1007/978-3-662-44440-5_19openalex-snapshot
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty - Revisited
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(96)00007-0openalex-snapshot
Artificial intelligence: A modern approach
inferredcites →https://doi.org/10.1016/s0004-3702(97)00009-xopenalex-snapshot
Processing disjunctions in temporal constraint networks
inferredcites →https://doi.org/10.1023/a:1025894003623openalex-snapshot
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning
inferredcites →https://doi.org/10.1109/time.2014.21openalex-snapshot
Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation
inferredcites →https://doi.org/10.4230/lipics.time.2017.23openalex-snapshot
Conditional Simple Temporal Networks with Uncertainty and Decisions
inferredcites →https://doi.org/10.48550/arxiv.1212.2005openalex-snapshot
The Dynamic Controllability of Conditional STNs with Uncertainty
inferredcites →https://doi.org/10.48550/arxiv.1401.4606openalex-snapshot
Drake: An Efficient Executive for Temporal Plans with Choice
inferredcites →https://doi.org/10.5220/0004256101440156openalex-snapshot
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-05453-3_7openalex-snapshot
Conditional Uncertainty in Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-35653-8_11openalex-snapshot
Computing History-Dependent Schedules for Processes with Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-66498-5_13openalex-snapshot
On the Complexity of Resource Controllability in Business Process Management
inferred← citeshttps://doi.org/10.1007/978-3-031-34241-7_9openalex-snapshot
A Time-Aware Model for Legal Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-031-61007-3_8openalex-snapshot
Introducing Agile Controllability in Temporal Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_18openalex-snapshot
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-98648-7_7openalex-snapshot
Managing Decision Tasks and Events in Time-Aware Business Process Models
inferred← citeshttps://doi.org/10.1007/s13740-021-00119-wopenalex-snapshot
Resource Controllability of Business Processes Under Conditional Uncertainty
inferred← citeshttps://doi.org/10.1007/s42979-020-00242-8openalex-snapshot
Conditional Schedules for Processes with Temporal Constraints
inferred← citeshttps://doi.org/10.1016/j.ic.2017.08.008openalex-snapshot
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104637openalex-snapshot
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104773openalex-snapshot
Mining CSTNUDs significant for a set of traces is polynomial
inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.099openalex-snapshot
Dynamic controllability of temporal networks with instantaneous reaction
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.023openalex-snapshot
Conditional simple temporal networks with uncertainty and decisions
inferred← citeshttps://doi.org/10.1109/time.2016.17openalex-snapshot
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete
inferred← citeshttps://doi.org/10.1109/tsc.2021.3134485openalex-snapshot
Integrated Exploration of Data-Intensive Business Processes
inferred← citeshttps://doi.org/10.1145/3366030.3366068openalex-snapshot
Computing Ranges for Temporal Parameters of Composed Web Services
inferred← citeshttps://doi.org/10.1145/3555776.3577618openalex-snapshot
Dynamic Controllability of Parameterized CSTNUs
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13756openalex-snapshot
Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6676openalex-snapshot
Dynamic Controllability and (J,K)-Resiliency in Generalized Constraint Networks with Uncertainty
inferred← citeshttps://doi.org/10.1613/jair.1.11453openalex-snapshot
Conditional Simple Temporal Networks with Uncertainty and Resources
inferred← citeshttps://doi.org/10.24963/ijcai.2018/184openalex-snapshot
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks
inferred← citeshttps://doi.org/10.4018/ijssoe.2018100101openalex-snapshot
Advanced Temporal Constraints for Business Processes Modelling and Execution
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06260openalex-snapshot
Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm)
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04132openalex-snapshot
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks -- Extended version with an Improved Upper Bound --
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.