Using Satisfiability for Non-optimal Temporal Planning (Q2915070): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and pruning: An optimal temporal POCL planner based on constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing concurrency in temporal planning using planner-scheduler interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 17:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Using Satisfiability for Non-optimal Temporal Planning
scientific article

    Statements

    Using Satisfiability for Non-optimal Temporal Planning (English)
    0 references
    0 references
    21 September 2012
    0 references
    0 references
    satisfiability checking
    0 references
    AI planning
    0 references
    temporal planning
    0 references
    simple temporal networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references