A fluent calculus semantics for ADL with plan constraints

Conrad Drescher; Michael Thielscher

doi:10.1007/978-3-540-87803-2_13

A fluent calculus semantics for ADL with plan constraints

Conrad Drescher
, Michael Thielscher

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

Plan constraints are the most recent addition to the ever growing Planning Domain Definition Language (PDDL). In this work we consider the PDDL fragment consisting of basic ADL extended by plan constraints. We provide a purely declarative semantics for this fragment by interpreting it in the basic Fluent Calculus. We thus obtain a logical semantics for this fragment of PDDL instead of the usual meta-theoretical state transition semantics.

Original language	English
Pages (from-to)	140-152
Number of pages	13
Journal	Lecture Notes in Computer Science
Volume	5293
DOIs	https://doi.org/10.1007/978-3-540-87803-2_13
Publication status	Published - 2008

Access to Document

10.1007/978-3-540-87803-2_13

Cite this

@article{a4b43c52aef64d3b93415eab3b25ee33,

title = "A fluent calculus semantics for ADL with plan constraints",

abstract = "Plan constraints are the most recent addition to the ever growing Planning Domain Definition Language (PDDL). In this work we consider the PDDL fragment consisting of basic ADL extended by plan constraints. We provide a purely declarative semantics for this fragment by interpreting it in the basic Fluent Calculus. We thus obtain a logical semantics for this fragment of PDDL instead of the usual meta-theoretical state transition semantics.",

author = "Conrad Drescher and Michael Thielscher",

year = "2008",

doi = "10.1007/978-3-540-87803-2\_13",

language = "English",

volume = "5293",

pages = "140--152",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

}

TY - JOUR

T1 - A fluent calculus semantics for ADL with plan constraints

AU - Drescher, Conrad

AU - Thielscher, Michael

PY - 2008

Y1 - 2008

N2 - Plan constraints are the most recent addition to the ever growing Planning Domain Definition Language (PDDL). In this work we consider the PDDL fragment consisting of basic ADL extended by plan constraints. We provide a purely declarative semantics for this fragment by interpreting it in the basic Fluent Calculus. We thus obtain a logical semantics for this fragment of PDDL instead of the usual meta-theoretical state transition semantics.

AB - Plan constraints are the most recent addition to the ever growing Planning Domain Definition Language (PDDL). In this work we consider the PDDL fragment consisting of basic ADL extended by plan constraints. We provide a purely declarative semantics for this fragment by interpreting it in the basic Fluent Calculus. We thus obtain a logical semantics for this fragment of PDDL instead of the usual meta-theoretical state transition semantics.

UR - http://handle.uws.edu.au:8081/1959.7/549782

U2 - 10.1007/978-3-540-87803-2_13

DO - 10.1007/978-3-540-87803-2_13

M3 - Article

SN - 0302-9743

VL - 5293

SP - 140

EP - 152

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

A fluent calculus semantics for ADL with plan constraints

Abstract

Access to Document

Other files and links

Fingerprint

Cite this