Agent planning programs
From MaRDI portal
Publication:899440
DOI10.1016/j.artint.2015.10.001zbMath1344.68245OpenAlexW2193441267MaRDI QIDQ899440
Alessandro Saetti, Alfonso E. Gerevini, Giuseppe De Giacomo, Fabio Patrizi, Sebastian Sardiña
Publication date: 28 December 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2015.10.001
reasoning about action and changeautomated planningagent-oriented programmingsynthesis of reactive systems
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Agent technology and artificial intelligence (68T42)
Related Items (2)
Knowledge-based programs as building blocks for planning ⋮ Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic behavior composition synthesis
- Synthesis of Reactive(1) designs
- A new representation and associated algorithms for generalized planning
- A heuristic search approach to planning with temporally extended preferences
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Symbolic model checking: \(10^{20}\) states and beyond
- Fast planning through planning graph analysis
- ConGolog, a concurrent programming language based on the situation calculus
- NuSMV: A new symbolic model checker
- IMPACTing SHOP: Putting an AI planner into a multi-agent environment
- Automata, logics, and infinite games. A guide to current research
- Using temporal logics to express search control knowledge for planning
- A verification framework for agent programming with declarative goals
- Intention is choice with commitment
- The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
- GOLOG: A logic programming language for dynamic domains
- Planning and reacting in uncertain and dynamic environments
- A Common Knowledge Representation for Plan Generation and Reactive Execution
- Soft Goals Can Be Compiled Away
- Deterministic generators and games for Ltl fragments
- Nondeterministic Algorithms
- An axiomatic basis for computer programming
- A Lower Bound on Web Services Composition
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Agent planning programs
