Agent planning programs
type: Item
instance of: scholarly article
title: Agent planning programs
zbMATH Open document ID: 1344.68245
author: Giuseppe De Giacomo
author: Alfonso E. Gerevini
author: Fabio Patrizi
author: Alessandro Saetti
author: Sebastian Sardiña
published in: Artificial Intelligence
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68N19
zbMATH DE Number: 6524436
zbMATH Keywords: agent-oriented programming
zbMATH Keywords: automated planning
zbMATH Keywords: reasoning about action and change
zbMATH Keywords: synthesis of reactive systems
describes a project that uses: JTLV
describes a project that uses: IndiGolog
describes a project that uses: RATSY
describes a project that uses: 2APL
describes a project that uses: Graphplan
describes a project that uses: ConGolog
describes a project that uses: GOLOG
describes a project that uses: NuSMV
describes a project that uses: AgentSpeak
MaRDI profile type: Publication
full work available at URL: j.artint.2015.10.001
OpenAlex ID: W2193441267
cites work: Deterministic generators and games for Ltl fragments
cites work: Using temporal logics to express search control knowledge for planning
cites work: A heuristic search approach to planning with temporally extended preferences
cites work: Synthesis of Reactive(1) designs
cites work: Fast planning through planning graph analysis
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: Q4804909
cites work: NuSMV: A new symbolic model checker
cites work: Intention is choice with commitment
cites work: A verification framework for agent programming with declarative goals
cites work: ConGolog, a concurrent programming language based on the situation calculus
cites work: Q5282994
cites work: Automatic behavior composition synthesis
cites work: Q4144755
cites work: IMPACTing SHOP: Putting an AI planner into a multi-agent environment
cites work: Q4385542
cites work: Nondeterministic Algorithms
cites work: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
cites work: Q4449304
cites work: Q5313998
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Q3624014
cites work: An axiomatic basis for computer programming
cites work: Q5715723
cites work: The FF planning system: Fast plan generation through heuristic search
cites work: Soft Goals Can Be Compiled Away
cites work: GOLOG: A logic programming language for dynamic domains
cites work: Q4449294
cites work: A Lower Bound on Web Services Composition
cites work: Q2728922
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Q4779807
cites work: The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
cites work: A new representation and associated algorithms for generalized planning
cites work: A Common Knowledge Representation for Plan Generation and Reactive Execution
cites work: Planning and reacting in uncertain and dynamic environments
DOI: 10.1016/J.ARTINT.2015.10.001
Recommended article: Q4252255
Recommended article: Q2728922
Recommended article: Q4708237
Recommended article: Q4799288
Recommended article: Planning for Multiagent Using ASP-Prolog
Recommended article: Probabilistic agent programs
Recommended article: Q4361583
description: scientific article; zbMATH DE number 6524436