miun.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
The logic of conflicts between decision making agents
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Technology and Media.ORCID iD: 0000-0002-0665-1889
2000 (English)In: Journal of logic and computation (Print), ISSN 0955-792X, E-ISSN 1465-363X, Vol. 10, no 4, p. 583-602Article in journal (Refereed) Published
Abstract [en]

We present a formal model for the analysis of conflicts in sets of autonomous agents restricted in the sense that they can be described in a (first-order) language and by a transaction mechanism. In this model, we allow for enrichment of agent systems with correspondence assertions, expressing the relationship between different entities in the formal specifications of the agents. Thereafter the specifications are analysed with respect to conflicts. If two specifications ale free of conflicts, the formulae of one specification together with the set of correspondence assertions do not restrict the models of the other specification, i.e. the agent system does not restrict the individual agents. The approach takes into account static as well as dynamic aspects of this kind of interaction. Classifications of complexity of determining whether two specifications are free of conflicts are also presented. Furthermore, if the agents are allowed to act in accordance with the result of executions of a decision module, a situation may occur where, for example, subsets of their possible goal sets are consistent, but in actual fact the individual agents may nevertheless always terminate in states that are in conflict. Therefore, the model is also enriched by processes for analysing when specifications are compatible with respect to states for which it is reasonable to assume that they eventually will be reached.

Place, publisher, year, edition, pages
2000. Vol. 10, no 4, p. 583-602
Keywords [en]
multi-agent system, conflict detection, conceptual schema, theorem, proving
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:miun:diva-13531ISI: 000089068400004Scopus ID: 2-s2.0-0034250830OAI: oai:DiVA.org:miun-13531DiVA, id: diva2:411003
Available from: 2011-04-15 Created: 2011-04-15 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Scopus

Authority records BETA

Ekenberg, Love

Search in DiVA

By author/editor
Ekenberg, Love
By organisation
Department of Information Technology and Media
In the same journal
Journal of logic and computation (Print)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 23 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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