Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715703 / rank
 
Normal rank

Latest revision as of 23:26, 3 June 2024

scientific article; zbMATH DE number 1715665
Language Label Description Also known as
English
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
scientific article; zbMATH DE number 1715665

    Statements

    Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (English)
    0 references
    3 March 2002
    0 references
    0 references
    planning
    0 references
    CSP compilation
    0 references
    constraint satisfaction
    0 references
    graphplan
    0 references
    encodings
    0 references
    EBL
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references