Skip to main content

Research Repository

Advanced Search

All Outputs (12)

Incentive-compatible mechanisms for norm monitoring in open multi-agent systems (2018)
Journal Article
Alechina, N., Halpern, J. Y., Kash, I. A., & Logan, B. (2018). Incentive-compatible mechanisms for norm monitoring in open multi-agent systems. Journal of Artificial Intelligence Research, 62, https://doi.org/10.1613/jair.1.11214

We consider the problem of detecting norm violations in open multi-agent systems (MAS).We show how, using ideas from scrip systems, we can design mechanisms where the agents comprising the MAS are incentivised to monitor the actions of other agents f... Read More about Incentive-compatible mechanisms for norm monitoring in open multi-agent systems.

On the complexity of resource-bounded logics (2018)
Journal Article
Alechina, N., Bulling, N., Demri, S., & Logan, B. S. (2018). On the complexity of resource-bounded logics. Theoretical Computer Science, 750, 69-100. https://doi.org/10.1016/j.tcs.2018.01.019

We revisit decidability results for resource-bounded logics and use decision problems on vector addition systems with states (VASS) in order to establish complexity characterisations of (decidable) model checking problems. We show that the model chec... Read More about On the complexity of resource-bounded logics.

Model-checking for Resource-Bounded ATL with production and consumption of resources (2017)
Journal Article
Alechina, N., Logan, B., Nguyen, H. N., & Raimondi, F. (2017). Model-checking for Resource-Bounded ATL with production and consumption of resources. Journal of Computer and System Sciences, 88, 126-144. https://doi.org/10.1016/j.jcss.2017.03.008

© 2017 The Authors Several logics for expressing coalitional ability under resource bounds have been proposed and studied in the literature. Previous work has shown that if only consumption of resources is considered or the total amount of resources... Read More about Model-checking for Resource-Bounded ATL with production and consumption of resources.

Fair decomposition of group obligations (2017)
Journal Article
Alechina, N., Hoek, W. V. D., & Logan, B. (2017). Fair decomposition of group obligations. Journal of Logic and Computation, 27(7), 2043-2062. https://doi.org/10.1093/logcom/exx012

We consider the problem of decomposing a group norm into a set of individual obligations for the agents comprising the group, such that if the individual obligations are fulfilled, the group obligation is fulfilled. Such an assignment of tasks to age... Read More about Fair decomposition of group obligations.

The virtues of idleness: a decidable fragment of resource agent logic (2017)
Journal Article
Alechina, N., Bulling, N., Logan, B., & Nguyen, H. N. (2017). The virtues of idleness: a decidable fragment of resource agent logic. Artificial Intelligence, 245, 56-85. https://doi.org/10.1016/j.artint.2016.12.005

© 2017 The Authors Alternating Time Temporal Logic (ATL) is widely used for the verification of multi-agent systems. We consider Resource Agent Logic (RAL), which extends ATL to allow the verification of properties of systems where agents act under r... Read More about The virtues of idleness: a decidable fragment of resource agent logic.

Qualitative Spatial Logics for Buffered Geometries (2016)
Journal Article
Du, H., & Alechina, N. (in press). Qualitative Spatial Logics for Buffered Geometries. Journal of Artificial Intelligence Research, 56, 693-745. https://doi.org/10.1613/jair.5140

This paper describes a series of new qualitative spatial logics for checking consistency of sameAs and partOf matches between spatial objects from different geospatial datasets, especially from crowd-sourced datasets. Since geometries in crowd-source... Read More about Qualitative Spatial Logics for Buffered Geometries.

Verifying systems of resource-bounded agents (2016)
Journal Article
Alechina, N., & Logan, B. (2016). Verifying systems of resource-bounded agents. Lecture Notes in Artificial Intelligence, 9709, 3-12. https://doi.org/10.1007/978-3-319-40189-8_1

Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions. However such approaches often ignore a key aspect of multi-agent systems, namely that the agents’ actions... Read More about Verifying systems of resource-bounded agents.

A method for matching crowd-sourced and authoritative geospatial data (2016)
Journal Article
Du, H., Alechina, N., Jackson, M., & Hart, G. (2016). A method for matching crowd-sourced and authoritative geospatial data. Transactions in GIS, 21(2), 406-427. https://doi.org/10.1111/tgis.12210

A method for matching crowd-sourced and authoritative geospatial data is presented. A level of tolerance is defined as an input parameter as some difference in the geometry representation of a spatial object is to be expected. The method generates ma... Read More about A method for matching crowd-sourced and authoritative geospatial data.

Coalition logic with individual, distributed and common knowledge (2016)
Journal Article
Ågotnes, T., & Alechina, N. (in press). Coalition logic with individual, distributed and common knowledge. Journal of Logic and Computation, Article exv085. https://doi.org/10.1093/logcom/exv085

Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic hav... Read More about Coalition logic with individual, distributed and common knowledge.

Alternating-time temporal logic with resource bounds (2015)
Journal Article
Nguyen, H. N., Alechina, N., Logan, B., & Rakib, A. (2015). Alternating-time temporal logic with resource bounds. Journal of Logic and Computation, https://doi.org/10.1093/logcom/exv034

Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability c... Read More about Alternating-time temporal logic with resource bounds.

Efficient minimal preference change (2015)
Journal Article
Alechina, N., Liu, F., & Logan, B. (2018). Efficient minimal preference change. Journal of Logic and Computation, 28(8), 1715–1733. https://doi.org/10.1093/logcom/exv027

In this article, we study a minimal change approach to preference dynamics. We treat a set of preferences as a special kind of theory, and define minimal change preference contraction and revision operations in the spirit of the Alchourrón, Gärdenfor... Read More about Efficient minimal preference change.

A logic for reasoning about knowledge of unawareness (2014)
Journal Article
Agotnes, T., & Alechina, N. (2014). A logic for reasoning about knowledge of unawareness. Journal of Logic, Language and Information, 23(2), https://doi.org/10.1007/s10849-014-9201-4

In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of” – without using a stronger statement such as... Read More about A logic for reasoning about knowledge of unawareness.