LiU Electronic Press
Full-text not available in DiVA
Author:
Dunin-Keplicz, Barbara ( Warsaw University)
Anh Nguyen, Linh ( Warsaw University)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
A Framework for Graded Beliefs, Goals and Intentions
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: IOS Press
Status:
Published
In:
Fundamenta Informaticae(ISSN 0169-2968)
Volume:
100
Issue:
1-4
Pages:
53-76
Year of publ.:
2010
URI:
urn:nbn:se:liu:diva-58781
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58781
ISI:
000280667600005
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Abstract(en) :

In natural language we often use graded concepts, reflecting different intensity degrees of certain features. Whenever such concepts appear in a given real-life context, they need to be appropriately expressed in its models. In this paper, we provide a framework which allows for extending the BGI model of agency by grading beliefs, goals and intentions. We concentrate on TEAMLOG [6, 7, 8, 9, 12] and provide a complexity-optimal decision method for its graded version TEAMLOG(K) by translating it into CPDLreg (propositional dynamic logic with converse and "inclusion axioms" characterized by regular languages). We also develop a tableau calculus which leads to the first EXPTIME (optimal) tableau decision procedure for CPDLreg. As CPDLreg is suitable for expressing complex properties of graded operators, the procedure can also be used as a decision tool for other multiagent formalisms.

Available from:
2010-08-27
Created:
2010-08-27
Last updated:
2011-02-27
Statistics:
11 hits