22 research outputs found

    Eliminating opportunism using an epistemic mechanism

    Get PDF
    Opportunism is a behavior that takes advantage of knowledge asymmetry and results in promoting agents' own value and demoting other agents' value. It is important to eliminate such a selfish behavior in multi-agent systems, as it has undesirable results for the participating agents. However, as the context we study here is multi-agent systems, system designers actually might not be aware of the value system for each agent thus they have no idea whether an agent will perform opportunistic behavior. Given this fact, this paper designs an epistemic mechanism to eliminate opportunism given a set of possible value systems for the participating agents: An agent's knowledge gets updated so that the other agent is not able to perform opportunistic behavior, and there exists a balance between eliminating opportunism and respecting agents' privacy

    Parity-energy ATL for Qualitative and Quantitative Reasoning in MAS

    Get PDF
    In this paper, we introduce a new logic suitable to reason about strategic abilities of multi-agent systems where (teams of) agents are subject to qualitative (parity) and quantitative (energy) constraints and where goals are represented, as usual, by means of temporal properties. We formally define such a logic, named parity-energy-atl (peatl, for short), and we study its model checking problem, which we prove to be decidable with different complexity upper bounds, depending on different choices for the energy range

    Tableau-based decision procedures for logics of strategic ability in multi-agent systems

    Full text link
    We develop an incremental tableau-based decision procedures for the Alternating-time temporal logic ATL and some of its variants. While running within the theoretically established complexity upper bound, we claim that our tableau is practically more efficient in the average case than other decision procedures for ATL known so far. Besides, the ease of its adaptation to variants of ATL demonstrates the flexibility of the proposed procedure.Comment: To appear in ACM Transactions on Computational Logic. 48 page

    Multi-Agent Only Knowing on Planet Kripke

    Get PDF
    International audienceThe idea of only knowing is a natural and intuitive notion to precisely capture the beliefs of a knowledge base. However, an extension to the many agent case, as would be needed in many applications , has been shown to be far from straightforward. For example, previous Kripke frame-based accounts appeal to proof-theoretic constructions like canonical models, while more recent works in the area abandoned Kripke semantics entirely. We propose a new account based on Moss' characteristic formulas, formulated for the usual Kripke semantics. This is shown to come with other benefits: the logic admits a group version of only knowing , and an operator for assessing the epistemic en-trenchment of what an agent or a group only knows is definable. Finally, the multi-agent only knowing operator is shown to be expressible with the cover modality of classical modal logic, which then allows us to obtain a completeness result for a fragment of the logic

    Types and taxonomic structures in conceptual modeling:A novel ontological theory and engineering support

    Get PDF
    Types are fundamental for conceptual modeling and knowledge representation, being an essential construct in all major modeling languages in these fields. Despite that, from an ontological and cognitive point of view, there has been a lack of theoretical support for precisely defining a consensual view on types. As a consequence, there has been a lack of precise methodological support for users when choosing the best way to model general terms representing types that appear in a domain, and for building sound taxonomic structures involving them. For over a decade now, a community of researchers has contributed to the development of the Unified Foundational Ontology (UFO) - aimed at providing foundations for all major conceptual modeling constructs. At the core of this enterprise, there has been a theory of types specially designed to address these issues. This theory is ontologically well-founded, psychologically informed, and formally characterized. These results have led to the development of a Conceptual Modelling language dubbed OntoUML, reflecting the ontological micro-theories comprising UFO. Over the years, UFO and OntoUML have been successfully employed on conceptual model design in a variety of domains including academic, industrial, and governmental settings. These experiences exposed improvement opportunities for both the OntoUML language and its underlying theory, UFO. In this paper, we revise the theory of types in UFO in response to empirical evidence. The new version of this theory shows that many of OntoUML's meta-types (e.g. kind, role, phase, mixin) should be considered not as restricted to substantial types but instead should be applied to model endurant types in general, including relator types, quality types, and mode types. We also contribute with a formal characterization of this fragment of the theory, which is then used to advance a new metamodel for OntoUML (termed OntoUML 2). To demonstrate that the benefits of this approach are extended beyond OntoUML, the proposed formal theory is then employed to support the definition of UFO-based lightweight Semantic Web ontologies with ontological constraint checking in OWL. Additionally, we report on empirical evidence from the literature, mainly from cognitive psychology but also from linguistics, supporting some of the key claims made by this theory. Finally, we propose a computational support for this updated metamodel.</p

    Logics of knowledge and action: critical analysis and challenges

    Get PDF
    International audienceWe overview the most prominent logics of knowledge and action that were proposed and studied in the multiagent systems literature. We classify them according to these two dimensions, knowledge and action, and moreover introduce a distinction between individual knowledge and group knowledge, and between a nonstrategic an a strategic interpretation of action operators. For each of the logics in our classification we highlight problematic properties. They indicate weaknesses in the design of these logics and call into question their suitability to represent knowledge and reason about it. This leads to a list of research challenges

    Simplicial Models for the Epistemic Logic of Faulty Agents

    Full text link
    In recent years, several authors have been investigating simplicial models, a model of epistemic logic based on higher-dimensional structures called simplicial complexes. In the original formulation, simplicial models were always assumed to be pure, meaning that all worlds have the same dimension. This is equivalent to the standard S5n semantics of epistemic logic, based on Kripke models. By removing the assumption that models must be pure, we can go beyond the usual Kripke semantics and study epistemic logics where the number of agents participating in a world can vary. This approach has been developed in a number of papers, with applications in fault-tolerant distributed computing where processes may crash during the execution of a system. A difficulty that arises is that subtle design choices in the definition of impure simplicial models can result in different axioms of the resulting logic. In this paper, we classify those design choices systematically, and axiomatize the corresponding logics. We illustrate them via distributed computing examples of synchronous systems where processes may crash

    Types and taxonomic structures in conceptual modeling: A novel ontological theory and engineering support

    Get PDF
    Types are fundamental for conceptual modeling and knowledge representation, being an essential construct in all major modeling languages in these fields. Despite that, from an ontological and cognitive point of view, there has been a lack of theoretical support for precisely defining a consensual view on types. As a consequence, there has been a lack of precise methodological support for users when choosing the best way to model general terms representing types that appear in a domain, and for building sound taxonomic structures involving them. For over a decade now, a community of researchers has contributed to the development of the Unified Foundational Ontology (UFO) - aimed at providing foundations for all major conceptual modeling constructs. At the core of this enterprise, there has been a theory of types specially designed to address these issues. This theory is ontologically well- founded, psychologically informed, and formally characterized. These results have led to the development of a Conceptual Modelling language dubbed OntoUML, reflecting the ontological micro-theories comprising UFO. Over the years, UFO and OntoUML have been successfully employed on conceptual model design in a variety of domains including academic, industrial, and governmental settings. These experiences exposed improvement opportunities for both the OntoUML language and its underlying theory, UFO. In this paper, we revise the theory of types in UFO in response to empirical evidence. The new version of this theory shows that many of OntoUML’s meta-types (e.g. kind, role, phase, mixin) should be considered not as restricted to substantial types but instead should be applied to model endurant types in general, including relator types, quality types, and mode types. We also contribute with a formal characterization of this fragment of the theory, which is then used to advance a new metamodel for OntoUML (termed OntoUML 2). To demonstrate that the benefits of this approach are extended beyond OntoUML, the proposed formal theory is then employed to support the definition of UFO-based lightweight Semantic Web ontologies with ontological constraint checking in OWL. Additionally, we report on empirical evidence from the literature, mainly from cognitive psychology but also from linguistics, supporting some of the key claims made by this theory. Finally, we propose a computational support for this updated metamodel

    Agent-oriented domain-specific language for the development of intelligentdistributed non-axiomatic reasoning agents

    Get PDF
    У дисертацији је представљен прототип агентског, домен-оријентисаног језика ALAS. Основни мотиви развоја ALAS језика су подршка дистрибуираном не-аксиоматском резоновању као и омогућавање интероперабилности и хетерогене мобилности Siebog агената јер је приликом анализе постојећих агентских домен-оријентисаних језика утврђено да ни један језик не подржава ове захтеве. Побољшање у односу на сличне постојеће агентске, домен-оријентисане језике огледа се и у програмским конструктима које нуди ALAS језик а чија је основна сврха писање концизних агената који се извршавају у специфичним доменима.U disertaciji je predstavljen prototip agentskog, domen-orijentisanog jezika ALAS. Osnovni motivi razvoja ALAS jezika su podrška distribuiranom ne-aksiomatskom rezonovanju kao i omogućavanje interoperabilnosti i heterogene mobilnosti Siebog agenata jer je prilikom analize postojećih agentskih domen-orijentisanih jezika utvrđeno da ni jedan jezik ne podržava ove zahteve. Poboljšanje u odnosu na slične postojeće agentske, domen-orijentisane jezike ogleda se i u programskim konstruktima koje nudi ALAS jezik a čija je osnovna svrha pisanje konciznih agenata koji se izvršavaju u specifičnim domenima.The dissertation presents the prototype of an agent-oriented, domainspecific language ALAS. The basic motives for the development of the ALAS language are support for distributed non-axiomatic reasoning, as well as enabling the interoperability and heterogeneous mobility of agents, because it is concluded by analysing existing agent-oriented, domainspecific languages, that there is no language that supports these requirements. The improvement compared to similar existing agentoriented, domain-specific languages are also reflected in program constructs offered by ALAS language, whose the main purpose is to enable writing the concise agents that are executed in specific domains
    corecore