PDDL
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Linear temporal logic as an executable semantics for planning languages
- Learning action models from plan examples using weighted MAX-SAT
- Reasoning from last conflict(s) in constraint programming
- PAYNT
- Texada
- CP-nets
- ConGolog
- GOLOG
- STAN
- IPC-4
- Walksat
- PASS
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search
- CPlan
- Strong temporal planning with uncontrollable durations
- BuDDy
- simpleAPL
- plasp
- GASP
- Graphplan
- FODD-Planner
- Recursive definitions of tabular transformations
- CCGbank
- Complexity issues for timeline-based planning over dense time under future and minimal semantics
- Coala
- Gradient-based mixed planning with symbolic and numeric action parameters
- TRAMP
- Decidability and complexity of action-based temporal planning over dense time
- SATMC
- A constraint-based approach to learn temporal features on action models from multiple plans
- Out of control: reducing probabilistic models by control-state elimination
- Galliwasp
- QBFLIB
- CCalc
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I
- Dynamic term-modal logics for first-order epistemic planning
- Selecting goals in oversubscription planning using relaxed plans
- A lightweight epistemic logic and its application to planning
- Deliberative acting, planning and learning with hierarchical operational models
- Model checking approach to automated planning
- SWORD
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- A constraint programming formulation for planning: From plan scheduling to plan generation
- Solve-and-robustify
- Landmark-based approaches for goal recognition as planning
- Book review of: P. Haslum et. al., An introduction to the planning domain definition language
- First-order stable model semantics with intensional functions
- Learning action models with minimal observability
- Position systems in dynamic domains
- Automated planning as an early verification tool for distributed control
- Bagging strategies for learning planning policies
- Logic of temporal attribute implications
- Automatic workflow verification and generation
- State-set branching: leveraging BDDs for heuristic search
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Temporal reasoning about fuzzy intervals
- Representations for robot knowledge in the \textsc{KnowRob} framework
- Planning as satisfiability: parallel plans and algorithms for plan search
- Constraint partitioning in penalty formulations for solving temporal planning problems
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- In defense of PDDL axioms
- Processes and continuous change in a SAT-based planner
- Understanding planning with incomplete information and sensing
- Handling fuzzy temporal constraints in a planning environment
- ANML
- CP methods for scheduling and routing with~time-dependent task costs
- ERA-PAT
- ASPMT2SMT
- TorchLight
- TEXPLORE
- On the importance of domain model configuration for automated planning engines
- Knowledge-based programs as building blocks for planning
- Goal distance estimation for automated planning using neural networks and support vector machines
- ArgoTriCS
- scientific article; zbMATH DE number 1696751 (Why is no real title available?)
- Managing temporal cycles in planning problems requiring concurrency
- Action failure recovery via model-based diagnosis and conformant planning
- Domain-independent planning for services in uncertain and dynamic environments
- Bounded situation calculus action theories
- Applications of action languages in cognitive robotics
- Gearing up for effective ASP planning
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- COLIN: planning with continuous linear numeric change
- SAP speaks PDDL: exploiting a software-engineering model for planning in business process management
- Using satisfiability for non-optimal temporal planning
- SHOP2
- Merge-and-Shrink Abstraction
- Experiences with planning for natural language generation
- SAPA
- Yochan
- PPlan
- Prodigy
- UCPOP
- VHPOP
- LPG
- AltAlt
- KnowRob
- SUMO
- Systems of relational transformations: rules and realizability criterion
- LINERLIB
This page was built for software: PDDL
