DeepAI AI Chat

The Fluted Fragment with Transitive Relations

06/19/2020

∙

by Ian Pratt-Hartmann, et al.

∙

∙

We study the satisfiability problem for the fluted fragment extended with transitive relations. The logic enjoys the finite model property when only one transitive relation is available and the finite model property is lost when additionally either equality or a second transitive relation is allowed. We show that the satisfiability problem for the fluted fragment with one transitive relation and equality remains decidable. On the other hand we show that the satisfiability problem is undecidable already for the two-variable fragment of the logic in the presence of three transitive relations (or two transitive relations and equality).

Ian Pratt-Hartmann
10 publications
Lidia Tendera
3 publications

∙ 06/21/2019

The Fluted Fragment with Transitivity

We study the satisfiability problem for the fluted fragment extended wit...

0 Ian Pratt-Hartmann, et al. ∙

∙ 05/25/2023

Logic of the Hide and Seek Game: Characterization, Axiomatization, Decidability

The logic of the hide and seek game LHS was proposed to reason about sea...

0 Qian Chen, et al. ∙

∙ 02/09/2021

k-Equivalence Relations and Associated Algorithms

Lines and circles pose significant scalability challenges in synthetic g...

0 Daniel Selsam, et al. ∙

∙ 02/10/2021

An Algebra of Properties of Binary Relations

We consider all 16 unary operations that, given a homogeneous binary rel...

0 Jochen Burghardt, et al. ∙

∙ 04/21/2021

Towards a more efficient approach for the satisfiability of two-variable logic

We revisit the satisfiability problem for two-variable logic, denoted by...

0 Ting-Wei Lin, et al. ∙

∙ 10/11/2021

Logical Foundations of Quantitative Equality (long version)

Quantitative reasoning provides a flexible approach capable to deal with...

0 Francesco Dagnino, et al. ∙

∙ 09/10/2018

Finite Satisfiability of Unary Negation Fragment with Transitivity

We show that the finite satisfiability problem for the unary negation fr...

0 Daniel Danielski, et al. ∙