Action Programming Languages
Artificial systems that think and behave intelligently are one of the most exciting and challenging goals of Artificial Intelligence. Action Programming is the art and science of devising high-level control strategies for autonomous systems which employ a mental model of their environment and which reason about their actions as a means to achieve their goals. Applications of this programming paradigm include autonomous software agents, mobile robots with high-level reasoning capabilities, and General Game Playing. These lecture notes give an in-depth introduction to the current state-of-the-art in action programming. The main topics are knowledge representation for actions, procedural action programming, planning, agent logic programs, and reactive, behavior-based agents. The only prerequisite for understanding the material in these lecture notes is some general programming experience and basic knowledge of classical first-order logic.
What people are saying - Write a review
We haven't found any reviews in the usual places.
52 ALP SEMANTICS
522 Operational Semantics
53 AN ALP INTERPRETER
54 AGENT LOGIC PROGRAMS WITH SENSING
Reactive Action Programs
35 A GOLOG INTERPRETER
CONCURRENCY AND INTERRUPTS
37 ACTION PROGRAMS WITH SENSING
Action Programs and Planning
42 PLANNING WITH PRUNING
43 PLANNING WITH PREFERENCES
Declarative Action Programs
action programming language action sequence Agent Logic Programs AgentSpeak Artiﬁcial Intelligence At(Agent at(agent,c At(r B,D,I,Select background theory basic desire formula behavior belief atom belief base belief literal cell clauses computed condition conﬁguration constraint handling rule control program control rules declarative action programs deﬁned deﬁnition denotes derivation rules do(a do(drop(gold domain axiomatization domain signature effect axioms empty encoding endProc endWhile environment example execution Figure ﬁnal ﬁnd ﬁrst Fluent Calculus ﬂuent f Formally foundational axioms function given goal gold GOLOG program Holds Holds(f intentions Linear Temporal Logic Location(v,l move ofﬁce ofﬂine operational semantics package Peg Solitaire planning problem precondition and effect precondition axioms predicate primitive actions procedural action programming proof calculus Put in words query requests satisﬁed second-order logic selected sensing actions sequence of actions Situation Calculus speciﬁc strategy successor state axioms Symbol Type temporal logic transition triggering event world model
Page 4 - A logic program is a finite set of clauses of the form p(t) \- Li, . . . , Ln, where p(t) is an atom and LI, . . . , Ln are literals, that is, atoms or negated atoms.