TY - GEN

T1 - A proposal for reasoning in agents

T2 - 1st International Workshop on Declarative Agent Languages and Technologies, DALT 2003 held in conjunction with 2nd International Joint Conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2003

AU - Flax, Lee

PY - 2004

Y1 - 2004

N2 - Johnson-Laird proposes a semantic theory of human reasoning taking into account finite human capacities. We cast this into logical formalism and define a notion of restricted semantic entailment. Corresponding to any set of logical structures, R, there is a restricted entailment with parameter R. The family of restricted entailments, generated as R varies over sets of structures, is shown to be a complete lattice and to approximate ordinary entailment in the sense of domain theory. A given restricted entailment, R say, can be modelled in a modal language with an operator ↓r. The modal language is sound and complete and there is a correspondence result: X R φ iff ↓ RX ↓Rφ, where X is a set of first-order sentences and φ is first-order. This forms the basis for the proposal that R be identified with agent reasoning and that ↓R encapsulate an agent. The existence of the lattice structure mentioned above means that several agents can be integrated into a super-agent or else distilled into a sub-agent by taking joins or meets.

AB - Johnson-Laird proposes a semantic theory of human reasoning taking into account finite human capacities. We cast this into logical formalism and define a notion of restricted semantic entailment. Corresponding to any set of logical structures, R, there is a restricted entailment with parameter R. The family of restricted entailments, generated as R varies over sets of structures, is shown to be a complete lattice and to approximate ordinary entailment in the sense of domain theory. A given restricted entailment, R say, can be modelled in a modal language with an operator ↓r. The modal language is sound and complete and there is a correspondence result: X R φ iff ↓ RX ↓Rφ, where X is a set of first-order sentences and φ is first-order. This forms the basis for the proposal that R be identified with agent reasoning and that ↓R encapsulate an agent. The existence of the lattice structure mentioned above means that several agents can be integrated into a super-agent or else distilled into a sub-agent by taking joins or meets.

UR - http://www.scopus.com/inward/record.url?scp=23144443847&partnerID=8YFLogxK

M3 - Conference proceeding contribution

AN - SCOPUS:23144443847

VL - 2990

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 173

EP - 190

BT - Declarative Agent Languages and Technologies - First International Workshop, DALT 2003

A2 - Leite, João

A2 - Omicini, Andrea

A2 - Sterling, Leon

A2 - Torroni, Paolo

PB - Springer, Springer Nature

CY - Berlin; Heidelberg

Y2 - 15 July 2003 through 15 July 2003

ER -