scholarly journals Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo

2021 ◽  
Author(s):  
Fabio Aurelio D'Asaro ◽  
Paolo Baldi ◽  
Giuseppe Primiero
Keyword(s):  
Computational Complexity ◽  
Propositional Logic ◽  
Multi Agent Systems ◽  
Classical Propositional Logic ◽  
Rational Agents ◽  
Agent Systems ◽  
Multi Agent ◽  
Future Work ◽  
Limited Depth

Depth-Bounded Boolean Logics (DBBL for short) are well-understood frameworks to model rational agents equipped with limited deductive capabilities. These Logics use a parameter k>=0 to limit the amount of virtual information, i.e., the information that the agent may temporarily assume throughout the deductive process. This restriction brings several advantageous properties over classical Propositional Logic, including polynomial decision procedures for deducibility and refutability. Inspired by DBBL, we propose a limited-depth version of the popular ASP system \clingo, tentatively dubbed k-lingo after the bound k on virtual information. We illustrate the connection between DBBL and ASP through examples involving both proof-theoretical and implementative aspects. The paper concludes with some comments on future work, which include a computational complexity characterization of the system, applications to multi-agent systems and feasible approximations of probability functions.

scholarly journals On Reasoning about Access to Knowledge

10.29007/z15j ◽  
2020 ◽  
Author(s):  
Yakoub Salhi
Keyword(s):  
Crucial Role ◽  
Propositional Logic ◽  
Basic Problem ◽  
Multi Agent Systems ◽  
Classical Propositional Logic ◽  
Inference Process ◽  
Agent Systems ◽  
Multi Agent ◽  
Classical Inference ◽  
Access To Knowledge

Controlling access to knowledge plays a crucial role in many multi-agent systems. In- deed, it is related to different central aspects in interactions among agents such as privacy, security, and cooperation. In this paper, we propose a framework for dealing with access to knowledge that is based on the inference process in classical propositional logic: an agent has access to every piece of knowledge that can be derived from the available knowledge using the classical inference process. We first introduce a basic problem in which an agent has to hide pieces of knowledge, and we show that this problem can be solved through the computation of maximal consistent subsets. In the same way, we also propose a coun- terpart of the previous problem in which an agent has to share pieces of knowledge, and we show that this problem can be solved through the computation of minimal inconsis- tent subsets. Then, we propose a generalization of the previous problem where an agent has to share pieces of knowledge and hide at the same time others. In this context, we introduce several concepts that allow capturing interesting aspects. Finally, we propose a weight-based approach by associating integers with the pieces of knowledge that have to be shared or hidden.

scholarly journals On Consensus Index of Triplex Star-Like Networks: A Graph Spectra Approach

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1248
Author(s):  
Da Huang ◽  
Jian Zhu ◽  
Zhiyong Yu ◽  
Haijun Jiang
Keyword(s):  
Algebraic Connectivity ◽  
Multi Agent Systems ◽  
Graph Spectra ◽  
Asymptotic Behaviors ◽  
Agent Systems ◽  
First Order ◽  
Laplacian Spectra ◽  
Multi Agent ◽  
Consensus Index

In this article, the consensus-related performances of the triplex multi-agent systems with star-related structures, which can be measured by the algebraic connectivity and network coherence, have been studied by the characterization of Laplacian spectra. Some notions of graph operations are introduced to construct several triplex networks with star substructures. The methods of graph spectra are applied to derive the network coherence, and some asymptotic behaviors of the indices have been derived. It is found that the operations of adhering star topologies will make the first-order coherence increase a constant value under the triplex structures as parameters tend to infinity, and the second-order coherence have some equality relations as the node related parameters tend to infinity. Finally, the consensus related indices of the triplex systems with the same number of nodes but non-isomorphic graph structures have been compared and simulated to verify the results.

scholarly journals From Algorithms to (Sub-)Symbolic Inferences in Multi-Agent Systems

2006 ◽  
Vol 1 (3) ◽  
pp. 5 ◽  
Author(s):  
Boldur E. Bărbat ◽  
Sorin C. Negulescu
Keyword(s):  
Information Technology ◽  
Software Engineering ◽  
Position Paper ◽  
Multi Agent Systems ◽  
Agent Architecture ◽  
Agent Systems ◽  
Symbolic Reasoning ◽  
Multi Agent ◽  
Intelligent Interaction ◽  
Future Work

Extending metaphorically the Moisilean idea of “nuanced-reasoning logic” and adapting it to the e-world age of Information Technology (IT), the paper aims at showing that new logics, already useful in modern software engineering, become necessary mainly for Multi-Agent Systems (MAS), despite obvious adversities. The first sections are typical for a position paper, defending such logics from an anthropocentric perspective. Through this sieve, Section 4 outlines the features asked for by the paradigm of computing as intelligent interaction, based on “nuances of nuanced-reasoning”, that should be reflected by agent logics. To keep the approach credible, Section 5 illustrates how quantifiable synergy can be reached - even in advanced challenging domains, such as stigmergic coordination - by injecting symbolic reasoning in systems based on sub-symbolic “emergent synthesis”. Since for future work too the preferred logics are doxastic, the conclusions could be structured in line with the well-known agent architecture: Beliefs, Desires, Intentions.

Simulating UAV Surveillance for Analyzing Impact of Commitments in Multi-Agent Systems

2012 ◽  
Vol 4 (1) ◽  
pp. 1-16
Author(s):  
David C. Han ◽  
Suzanne K. Barber
Keyword(s):  
Autonomous Agents ◽  
Dynamic Environment ◽  
Action Selection ◽  
Best Interests ◽  
Multi Agent Systems ◽  
Rational Agents ◽  
Agent Systems ◽  
Negative Effect ◽  
Multi Agent ◽  
Selection Framework

Autonomous agents, by definition, have the freedom to make their own decisions. Rational agents execute actions that are in their “best interests” according to their desires. Action selection is complicated due to uncertainty when operating in a dynamic environment or where other agents can also influence the environment. This paper presents an action selection framework and algorithms that are rational with respect to multiple desires and responsive to changing desires. Coordination is layered on top of this framework by describing and analyzing how commitments affect the agents’ desires in their action selection models. Commitments may have a positive or a negative effect on an agent’s ability to satisfy its desires. This research uses simulation in the domain of UAV surveillance to experimentally explore the balance between under-commitment and over-commitment.

scholarly journals Characterization of Multi-agent systems: A systematic mapping study

2020 ◽  
Author(s):  
Diego Fernando Andaluz Espinosa ◽  
Patricio Alejandro Molina Palma ◽  
José Rubén Caiza Caizabuano
Keyword(s):  
Systematic Mapping Study ◽  
Multi Agent Systems ◽  
Recent Issue ◽  
Mapping Study ◽  
Systematic Mapping ◽  
Agent Systems ◽  
Multi Agent ◽  
Research Questions ◽  
Preliminary Classification

Multi-agent systems have gained a lot of interest in articles, conferences and magazines. However, it is still a recent issue which is not understood or the scope of it is unknown. The objective of this work is to investigate in more detail the articles and to build a preliminary classification system to structure the field of Multi-agent systems. As a result, an overview of this area of research can be obtained through the response to the research questions posed. Resumen. Los sistemas multi-agente han ganado un interés muy grande en artículos, conferencias y revistas. Sin embargo sigue siendo un tema reciente el cual no se comprende ni se conoce los alcances del mismo. Este trabajo tiene como objetivo investigar con más detalle los artículos y construir un sistema de clasificación preliminar para estructurar el campo de los sistemas Multi-agente. Como resultado, se espera proporcionar una visión general de esta área de investigación a través de responder a las preguntas de investigación planteadas. Creemos que el presente trabajo será una herramienta que encontrará ámbitos todavía aun no investigados.

scholarly journals Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability

2019 ◽  
Vol 33 ◽  
pp. 2817-2826
Author(s):  
Liangda Fang ◽  
Kewen Wang ◽  
Zhe Wang ◽  
Ximing Wen
Keyword(s):  
Normal Form ◽  
Propositional Logic ◽  
Disjunctive Normal Form ◽  
Modal Logics ◽  
Multi Agent Systems ◽  
Modal Formula ◽  
Agent Systems ◽  
Multi Agent ◽  
Automatic Planning ◽  
Reasoning Tasks

Modal logics are primary formalisms for multi-agent systems but major reasoning tasks in such logics are intractable, which impedes applications of multi-agent modal logics such as automatic planning. One technique of tackling the intractability is to identify a fragment called a normal form of multiagent logics such that it is expressive but tractable for reasoning tasks such as entailment checking, bounded conjunction transformation and forgetting. For instance, DNF of propositional logic is tractable for these reasoning tasks. In this paper, we first introduce a notion of logical separability and then define a novel disjunctive normal form SDNF for the multiagent logic Kn, which overcomes some shortcomings of existing approaches. In particular, we show that every modal formula in Kn can be equivalently casted as a formula in SDNF, major reasoning tasks tractable in propositional DNF are also tractable in SDNF, and moreover, formulas in SDNF enjoy the property of logical separability. To demonstrate the usefulness of our approach, we apply SDNF in multi-agent epistemic planning. Finally, we extend these results to three more complex multi-agent logics Dn, K45n and KD45n.

Sign in / Sign up

Export Citation Format

Share Document