Normative organisations provide a means to coordinate the activities of individual agents in multiagent settings. The coordination is realized at run time by creating obligations and prohibitions (norms) for agents. If an agent cannot meet obligation or violates prohibition, organisation imposes sanction on agent. In this paper, we consider norm-aware that deliberate their goals, norms sanctions before deciding which plan select execute. A able violate (accepting resulting sanctions) if it...

Journal Article Logic for coalitions with bounded resources Get access Natasha Alechina, Alechina School of Computer Science, The University Nottingham, Nottingham NG8 1BB, UK. E-mail: nza@cs.nott.ac.uk; bsl@cs.nott.ac.uk; hnn@cs.nott.ac.uk; rza@cs.nott.ac.uk Search other works by this author on: Oxford Academic Google Scholar Brian Logan, Logan Hoang Nga Nguyen, Nguyen Abdur Rakib and Computation, Volume 21, Issue 6, December 2011, Pages 907–937, https://doi.org/10.1093/logcom/exq032...

Structural Equation Models (SEM) are the standard approach to representing causal dependencies between variables in models. In this paper we propose a new interpretation of SEMs when reasoning about Actual Causality, which viewed as mechanisms transforming dynamics exogenous into endogenous variables. This allows us combine counterfactual with existing temporal logic formalisms, and introduce logic, CPLTL, for such structures. We show that restriction so-called \textit{recursive} models...

Causality plays an important role in daily processes, human reasoning, and artificial intelligence. There has however not been much research on causality multi-agent strategic settings. In this work, we introduce a systematic way to build system model, represented as concurrent game structure, for given structural causal model. the obtained so-called transitions correspond interventions agent variables of The Halpern Pearl framework is used determine effects certain value variable other...

There has been considerable work on reasoning about the strategic ability of agents under imperfect information. However, existing logics such as Probabilistic Strategy Logic are unable to express properties relating information transparency. Information transparency concerns extent which agents' behaviours and actions observable by other agents. Reasoning is useful in many domains including security, privacy, decision-making. In this paper, we present a formal framework for stochastic...

Structural equation models (SEM) are a standard approach to representing causal dependencies between variables. In this paper we propose new interpretation of existing formalisms in the field Actual Causality which SEM's viewed as mechanisms transforming dynamics exogenous variables into endogenous This allows us combine counterfactual reasoning with temporal logic formalizms, and introduce logic, CPLTL, for about such structures. Then, demonstrate that restriction so-called recursive (with...

Many problems in AI and multi-agent systems research are most naturally formulated terms of the abilities a coalition agents. There exist several excellent logical tools for reasoning about coalitional ability. However, ability can be affected by availability resources, there is no straightforward way resource requirements logics such as Coalition Logic (CL) Alternating-time Temporal (ATL). In this paper, we propose logic under constraints. We extend ATL with costs actions hence strategies....

Abstract This article describes results from a research project undertaken to explore the technical issues associated with integrating unstructured crowd sourced data authoritative national mapping data. The ultimate objective is develop methodologies ensure feature enrichment of data, using Users increasingly find that they wish use both kinds geographic sources. Different techniques and can be developed solve this problem. In our previous research, position map matching algorithm was for...

Abstract Coalition logic is currently one of the most popular logics for multi-agent systems. While combining coalitional and epistemic operators have received considerable attention, completeness results extensions coalition so far been missing. In this paper we provide several such proofs. We prove with common knowledge, distributed both respectively. Furthermore, completely characterise complexity satisfiability problem each three logics. also study interaction axioms connecting ability knowledge.

We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time derive consequences of their knowledge. The semantics TRL is grounded in the agentýs computation, allowing an unambiguous ascription set formulas which agent actually knows at t. show that can capture various rule application and conflict resolution strategies rule-based may employ, analyse two examples detail: TRL(STEP) models all rules each cycle strategy similar...

In this paper, we consider the runtime monitoring of norms with imperfect monitors. A monitor is for a norm if it has insufficient observational capabilities to determine given execution trace multi-agent system complies or violates norm. One approach problem monitors enhance normative organisation. However may be costly in some cases impossible. Instead show how synthesise an approximation `ideal' that can perfectly monitored monitor, and which optimal sense any other would fail detect at...

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 total amount produced consumed on any path system bounded, then model-checking problem several standard logics, such as Resource-Bounded Coalition Logic (RB-CL) Alternating-Time Temporal (RB-ATL) decidable. However, coalition with unbounded production consumption, some undecidability results...

published or not.The documents may come from teaching and research institutions in France abroad, public private centers.

The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than defined in terms of possible worlds. In this study, we combine with modal logic, using transition systems model reasoning. We use two modalities: 'knowing at least' a set formulae and most' formulae. are particularly interested models restricting known an agent point time be finite. resulting investigated from view axiomatization complexity. show how these logics can...

Abstract A method for matching crowd‐sourced and authoritative geospatial data is presented. level of tolerance defined as an input parameter some difference in the geometry representation a spatial object to be expected. The generates matches between objects using location information lexical information, such names types, verifies consistency reasoning qualitative description logic. We test by from OpenStreetMap national mapping agencies Great Britain France. also analyze how affects...

A central issue in the specification and verification of autonomous agents multiagent systems is ascription responsibility to individual groups agents. When designing a (multi)agent system, we must specify which or are responsible for bringing about particular state affairs. Similarly, when verifying may wish determine affairs, contribution each agent that In this paper, discuss several aspects responsibility, including strategic ability agents, their epistemic properties, relationship...

Logical approaches to reasoning about agents often rely on idealisations belief ascription and logical omniscience which make it difficult apply the results obtained real agents. In this paper, we show how ascribe beliefs an ability reason in arbitrary decidable logic agent a computationally grounded way. We characterise those cases assumption that is logically omniscient given 'harmless' sense does not lead making incorrect predictions agent, such harmless when our have temporal dimension:...

We present AgentSpeak(RT), a real-time BDI agent programming language based on AgentSpeak(L). AgentSpeak(RT) extends AgentSpeak intentions with deadlines which specify the time by should respond to an event, and priorities relative importance of responding particular event. The interpreter commits priority-maximal set intentions: is maximally feasible while preferring higher priority intentions. prove some properties language, such as guaranteed reactivity delay probabilistic guarantees...

Coalition logic is currently one of the most popular logics for multi-agent systems. While combining coalitional and epistemic operators have received considerable attention, completeness results extensions coalition so far been missing. In this paper we provide several such proofs. We prove with common knowledge, distributed both respectively. Furthermore, completely characterise complexity satisfiability problem each three logics.

Reachability logic: an efficient fragment of transitive closure logic Get access N Alechina, Alechina Search for other works by this author on: Oxford Academic Google Scholar Immerman Logic Journal the IGPL, Volume 8, Issue 3, May 2000, Pages 325–337, https://doi.org/10.1093/jigpal/8.3.325 Published: 01 2000