CPlan

swMATH5037MaRDI QIDQ17177FDOQ17177

Author name not available (Why is that?)

Cited In (26)

• A weighted CSP approach to cost-optimal planning
• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• AI planning in a constraint programming framework
• Title not available (Why is that?)
• New methods for proving the impossibility to solve problems through reduction of problem spaces
• Long-distance mutual exclusion for planning
• Planning as heuristic search
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Planning as satisfiability: parallel plans and algorithms for plan search
• Binary vs. non-binary constraints
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Concise finite-domain representations for PDDL planning tasks
• Solving Simple Planning Problems with More Inference and No Search
• Principles and Practice of Constraint Programming – CP 2003
• A constraint programming formulation for planning: From plan scheduling to plan generation
• Functional strips: A more flexible language for planning and problem solving
• Title not available (Why is that?)
• Combining linear programming and satisfiability solving for resource planning
• Title not available (Why is that?)
• Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
• Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan
• Logic Programming
• Constraint solving in uncertain and dynamic environments: A survey
• Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
• Planning and control in artificial intelligence: A unifying perspective
• Modelling and solving English peg solitaire

This page was built for software: CPlan