Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (Q2321284): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2018.11.008 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1901.02307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantified linear implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient execution of dynamically controllable simple temporal networks with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Controllability and Dispatchability Relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Controllability of Disjunctive Temporal Problems with Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtracking algorithms for disjunctions of temporal constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a decision procedure for quantified linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTP: A new constraint-based formalism for conditional, temporal planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling contingency in temporal constraint networks: from consistency to controllabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating decision nodes into conditional simple temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional simple temporal networks with uncertainty and decisions / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128455346 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2018.11.008 / rank
 
Normal rank

Latest revision as of 00:09, 18 December 2024

scientific article
Language Label Description Also known as
English
Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
scientific article

    Statements

    Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (English)
    0 references
    0 references
    0 references
    28 August 2019
    0 references
    temporal planning
    0 references
    temporal uncertainty
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references