English
Related papers

Related papers: Fusions of One-Variable First-Order Modal Logics

200 papers

Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…

Logic in Computer Science · Computer Science 2022-02-02 Alessandro Artale , Andrea Mazzullo , Ana Ozaki

This paper deals with many-valued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated…

Logic · Mathematics 2009-10-02 Felix Bou , Francesc Esteva , Lluis Godo , Ricardo Rodriguez

An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…

Artificial Intelligence · Computer Science 2007-05-23 J. Engelfriet

We present a clausal resolution-based method for normal multimodal logics of confluence, whose Kripke semantics are based on frames characterised by appropriate instances of the Church-Rosser property. Here we restrict attention to eight…

Logic in Computer Science · Computer Science 2014-08-20 Cláudia Nalon , João Marcos , Clare Dixon

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

Logic in Computer Science · Computer Science 2021-05-14 Dominik D. Freydenberger , Liat Peterfreund

In the product $L_1\times L_2$ of two Kripke complete consistent logics, local tabularity of $L_1$ and $L_2$ is necessary for local tabularity of $L_1\times L_2$. However, it is not sufficient: the product of two locally tabular logics may…

Logic · Mathematics 2025-01-22 Ilya B. Shapirovsky , Vladislav Sliusarev

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

Logic in Computer Science · Computer Science 2024-12-02 Daumantas Kojelis

Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…

Logic in Computer Science · Computer Science 2017-06-14 Marco Voigt

Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying…

Logic · Mathematics 2014-01-07 Tarek Sayed Ahmed

A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…

Logic · Mathematics 2018-03-28 Tomasz Kowalski , George Metcalfe

We study extensions of expressive decidable fragments of first-order logic with circumscription, in particular the two-variable fragment FO$^2$, its extension C$^2$ with counting quantifiers, and the guarded fragment GF. We prove that if…

Artificial Intelligence · Computer Science 2024-08-23 Carsten Lutz , Quentin Manière

We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…

Logic · Mathematics 2025-10-01 Arturo Rodriguez Fanlo , Ori Segel

Bayesian reasoning plays a significant role both in human rationality and in machine learning. In this paper, we introduce transfinite modal logic, which combines modal logic with ordinal arithmetic, in order to formalize Bayesian reasoning…

Artificial Intelligence · Computer Science 2022-04-08 Xinyu Wang

We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are…

Logic in Computer Science · Computer Science 2019-05-13 Daniel Găină , Ionuţ Ţuţu

A theoretical framework bridging General Relativity (GR) and Quantum Dynamics (QD) is introduced through the application of Kripke semantics and linear logic. While conventional unification efforts often rely on structural or geometrical…

Quantum Physics · Physics 2025-04-01 Arturo Tozzi , Michel Planat

We investigate completeness for modal G\"odel logics with respect to finite G\"odel-Kripke models, along with related aspects. It is well known that the logics studied in [4, 11] fail to be complete with respect to finite G\"odel-Kripke…

Logic · Mathematics 2026-05-18 Amanda Vidal , Ricardo O. Rodriguez

In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko V\"a\"aan\"anen as an extension of first-order (resp. modal) logic by the dependence operator =(). For first-order (resp. propositional) variables…

Logic in Computer Science · Computer Science 2012-06-21 Peter Lohmann

In a recent paper, Krawczyk proved that there are continuum many axiomatic extensions of global consequence associated with the modal system $E$ that do not admit the local deduction detachment theorem. In algebraic parlance, he showed that…

Logic · Mathematics 2024-02-13 Zalán Gyenis , Zalán Molnár

This paper investigates neighborhood and algebraic models for predicate modal logics with $\omega$-rules, including non-normal cases. We establish sufficient conditions under which such logics have neighborhood models with constant domains…

Logic · Mathematics 2026-04-29 Yoshihito Tanaka

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino
‹ Prev 1 3 4 5 6 7 10 Next ›