liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tractable Reasoning about Group Beliefs
University of Warsaw, Poland.
Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering. University of Warsaw, Poland.
University of Groningen, Netherlands.
2014 (English)In: ENGINEERING MULTI-AGENT SYSTEMS, EMAS 2014, SPRINGER INT PUBLISHING AG , 2014, Vol. 8758, p. 328-350Conference paper, Published paper (Refereed)
Abstract [en]

In contemporary autonomous systems, like robotics, the need to apply group knowledge has been growing consistently with the increasing complexity of applications, especially those involving teamwork. However, classical notions of common knowledge and common belief, as well as their weaker versions, are too complex. Also, when modeling real-world situations, lack of knowledge and inconsistency of information naturally appear. Therefore, we propose a shift in perspective from reasoning in multi-modal logics to querying paraconsistent knowledge bases. This opens the possibility for exploring a new approach to group beliefs. To demonstrate expressiveness of our approach, examples of social procedures leading to complex belief structures are constructed via the use of epistemic profiles. To achieve tractability without compromising the expressiveness, as an implementation tool we choose 4QL, a four-valued rule-based query language. This permits both to tame inconsistency in individual and group beliefs and to execute the social procedures in polynomial time. Therefore, a marked improvement in efficiency has been achieved over systems such as (dynamic) epistemic logics with common knowledge and ATL, for which problems like model checking and satisfiability are PSPACE- or even EXPTIME-hard.

Place, publisher, year, edition, pages
SPRINGER INT PUBLISHING AG , 2014. Vol. 8758, p. 328-350
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 8758
Keywords [en]
Cooperation; reasoning for robotic agents; formal models of agency; knowledge representation; tractability
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:liu:diva-119280DOI: 10.1007/978-3-319-14484-9_17ISI: 000354765300017ISBN: 978-3-319-14484-9 (print)ISBN: 978-3-319-14483-2 (print)OAI: oai:DiVA.org:liu-119280DiVA, id: diva2:820504
Conference
2nd International Workshop on Engineering Multi-Agent Systems (EMAS)
Available from: 2015-06-12 Created: 2015-06-12 Last updated: 2018-02-07

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Szalas, Andrzej

Search in DiVA

By author/editor
Szalas, Andrzej
By organisation
Artificial Intelligence and Integrated Computer SystemsFaculty of Science & Engineering
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 114 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf