Paper Info
Title
Reliable Agent Computation: An Algebraic Approach
Abstract
Agent programming languages based on a sense-compute-act cycle and stored plan execution, such as PRS and dMARS, lack any formal semantics; this and the actual computational models which they employ can make it difficult or impossible to reason about agent behaviour. In this paperwe present the 驴 calculus, a novel algebraic language which generalizes and extends these languages and remedies several of their shortcomings. 驴 has a complete operational semantics covering all aspects of agent computation from intention step execution to the top-level control cycle, specified uniformly in process algebraic style, and has certain desirable safety, guarantee and compositionality properties which facilitate reasoning about agent program behaviour.
Year
DOI
Venue
2001
10.1007/3-540-44637-0_3
PRIMA
Keywords
Field
DocType
complete operational semantics,agent program behaviour,agent behaviour,algebraic approach,plan execution,agent computation,intention step execution,process algebraic style,agent programming language,reliable agent computation,novel algebraic language,formal semantics,operational semantics,computer model,process algebra
Principle of compositionality,Knowledge representation and reasoning,Operational semantics,Programming language,Algebraic number,Work in process,Computer science,Theoretical computer science,Computational model,Computation,Semantics of logic
Conference
ISBN
Citations 
PageRank 
3-540-42434-2
1
0.43
References 
Authors
13
1
Name
Order
Citations
PageRank
David Kinny11940210.96