English
Related papers

Related papers: A first-order Temporal Logic for Actions

200 papers

In the context of abstract argumentation, we present the benefits of considering temporality, i.e. the order in which arguments are enunciated, as well as causality. We propose a formal method to rewrite the concepts of acyclic abstract…

Artificial Intelligence · Computer Science 2024-02-07 Y. Munro , C. Sarmiento , I. Bloch , G. Bourgne , M. -J. Lesot

Alloy is formal modeling language based on first-order relational logic, with no specific support for specifying reactive systems. We propose the usage of temporal logic to specify such systems, and show how bounded model checking can be…

Software Engineering · Computer Science 2015-06-26 Alcino Cunha

We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.

Logic · Mathematics 2019-11-19 Samuel Alexander

Whereas standard treatments of temporal logic are adequate for closed systems, having no run-time interactions with their environment, they fall short for reactive systems, interacting with their environments through synchronisation of…

Logic in Computer Science · Computer Science 2020-09-01 Rob van Glabbeek

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

Logic in Computer Science · Computer Science 2014-12-11 Fred Mesnard , Etienne Payet

The aim of illocutionary logic is to explain how context can affect the meaning of certain special kinds of performative utterances. Recall that performative utterances are understood as follows: a speaker performs the illocutionary act…

Logic in Computer Science · Computer Science 2011-02-24 Andrew Schumann

In this paper we investigate further the tableaux system for a deontic action logic we presented in previous work. This tableaux system uses atoms (of a given boolean algebra of action terms) as labels of formulae, this allows us to embrace…

Logic in Computer Science · Computer Science 2014-01-07 Pablo F. Castro , Thomas S. E. Maibaum

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

Category theory can be used to state formulas in First-Order Logic without using set membership. Several notable results in logic such as proof of the continuum hypothesis can be elegantly rewritten in category theory. We propose in this…

Logic in Computer Science · Computer Science 2022-04-19 Chan Le Duc

In this short note, we are concerned with the fairness condition "A and B hold almost equally often", which is important for specifying and verifying the correctness of non-terminating processes and protocols. We introduce the logic of…

Logic in Computer Science · Computer Science 2023-06-05 Thomas Studer

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

Logic · Mathematics 2024-11-20 Petr Cintula , George Metcalfe , Naomi Tokuda

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman

We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.

Logic in Computer Science · Computer Science 2014-09-15 Damien Doligez , Jael Kriener , Leslie Lamport , Tomer Libal , Stephan Merz

This paper presents a qualitative study that investigates the effects of some language choices in expressing the trigger part of a trigger-action rule on the users' mental models. Specifically, we explored how 11 non-programmer participants…

Human-Computer Interaction · Computer Science 2023-10-11 Margherita Andrao , Barbara Treccani , Massimo Zancanaro

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto

We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a…

Logic in Computer Science · Computer Science 2015-07-01 Juha Kontinen , Heribert Vollmer

We survey dynamic logics for specifying and verifying properties of dynamical systems, including hybrid systems, distributed hybrid systems, and stochastic hybrid systems. A dynamic logic is a first-order modal logic with a pair of…

Logic in Computer Science · Computer Science 2021-06-07 André Platzer

Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain's embedding of definite propositional causal theories into logic programming paved the…

Artificial Intelligence · Computer Science 2011-06-03 Paolo Ferraris , Joohyung Lee , Yuliya Lierler , Vladimir Lifschitz , Fangkai Yang

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time,…

Logic in Computer Science · Computer Science 2011-01-11 Julien Cristau
‹ Prev 1 3 4 5 6 7 10 Next ›