English
Related papers

Related papers: Putting the Agents back in the Domain: A Two-Sorte…

200 papers

We present a taxonomy of the variability mechanisms offered by modeling languages. The definition of a formal language encompasses a syntax and a semantic domain as well as the mapping that relates them, thus language variabilities are…

Software Engineering · Computer Science 2014-09-24 Maria Victoria Cengarle , Hans Grönninger , Bernhard Rumpe

ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this…

Logic in Computer Science · Computer Science 2015-07-01 Francois Laroussinie , Nicolas Markey , Ghassan Oreiby

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…

Logic in Computer Science · Computer Science 2023-06-22 Andreas Krebs , Kamal Lodaya , Paritosh K. Pandya , Howard Straubing

Reasoning is a fundamental cognitive process underlying inference, problem-solving, and decision-making. While large language models (LLMs) demonstrate strong reasoning capabilities in closed-world settings, they struggle in open-ended and…

In this paper, we extend previous work on distributed reasoning using Contextual Defeasible Logic (CDL), which enables decentralised distributed reasoning based on a distributed knowledge base, such that the knowledge from different…

Artificial Intelligence · Computer Science 2020-10-02 Helio H. L. C. Monte-Alto , Mariela Morveli-Espinoza , Cesar A. Tacla

Epistemic logics of intensional groups lift the assumption that membership in a group of agents is common knowledge. Instead of being represented directly as a set of agents, intensional groups are represented by a property that may change…

Logic in Computer Science · Computer Science 2023-07-12 Marta Bílková , Igor Sedlár

We study an extension of FO^2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, `the letter a appears between…

Logic in Computer Science · Computer Science 2016-03-18 Andreas Krebs , Kamal Lodaya , Paritosh Pandya , Howard Straubing

Social norms are powerful formalism in coordinating autonomous agents' behaviour to achieve certain objectives. In this paper, we propose a dynamic normative system to enable the reasoning of the changes of norms under different…

Artificial Intelligence · Computer Science 2016-04-19 Xiaowei Huang , Ji Ruan , Qingliang Chen , Kaile Su

We combine quantified differential dynamic logic (QdL) for reasoning about the possible behavior of distributed hybrid systems with temporal logic for reasoning about the temporal behavior during their operation. Our logic supports…

Logic in Computer Science · Computer Science 2012-07-12 Ping Hou

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

This paper continues the line of work on representing properties of actions in nonmonotonic formalisms that stresses the distinction between being "true" and being "caused", as in the system of causal logic introduced by McCain and Turner…

Artificial Intelligence · Computer Science 2023-07-21 Enrico Giunchiglia , Joohyung Lee , Vladimir Lifschitz , Hudson Turner

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

Logic in Computer Science · Computer Science 2021-03-30 Alexandru Baltag , Johan van Benthem

In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with…

cmp-lg · Computer Science 2008-02-03 Jan Jaspars , Megumi Kameyama

Alternating-time temporal logics (ATL/ATL*) represent a family of modal logics for reasoning about agents' strategic abilities in multiagent systems (MAS). The interpretations of ATL/ATL* over the semantic model Concurrent Game Structures…

Artificial Intelligence · Computer Science 2018-11-28 Yedi Zhang , Fu Song , Taolue Chen

We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted…

Logic in Computer Science · Computer Science 2023-06-22 Martin Lück

Equipping a conversational search engine with strategies regarding when to ask clarification questions is becoming increasingly important across various domains. Attributing to the context understanding capability of LLMs and their access…

Computation and Language · Computer Science 2024-06-04 Yue Chen , Chen Huang , Yang Deng , Wenqiang Lei , Dingnan Jin , Jia Liu , Tat-Seng Chua

We propose extending Alternating-time Temporal Logic (ATL) by an operator <i refines-to G> F to express that agent i can distribute its powers to a set of sub-agents G in a way which satisfies ATL condition f on the strategic ability of the…

Logic in Computer Science · Computer Science 2014-04-04 Dimitar P. Guelev

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…

Logic in Computer Science · Computer Science 2025-07-16 Renato Leme , Carlos Olarte , Elaine Pimentel , Marcelo E. Coniglio