On two-variable guarded fragment logic with expressive local Presburger constraints

06/28/2022
by   Chia-hsuan Lu, et al.
0

We consider the extension of two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at most three times the number of incoming green edges" and captures various description logics up to 𝒜ℒ𝒞ℐℋb^. We show that the satisfiability of this logic is EXP-complete. While the lower bound already holds for the standard two-variable guarded fragment logic, the upper bound is established by a novel, yet simple deterministic graph theoretic based algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2020

Two variable logic with ultimately periodic counting

We consider the extension of two variable logic with quantifiers that st...
research
12/25/2018

Revisiting Timed Logics with Automata Modalities

It is well known that (timed) ω-regular properties such as `p holds at e...
research
05/30/2022

LTL with Local and Remote Data Constraints

We consider an extension of linear-time temporal logic (LTL) with both l...
research
05/10/2021

HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete

Temporal logics for the specification of information-flow properties are...
research
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...
research
07/25/2017

A Decidable Very Expressive Description Logic for Databases (Extended Version)

We introduce DLR^+, an extension of the n-ary propositionally closed des...
research
02/14/2020

Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints

We introduce and investigate the expressive description logic (DL) ALCSC...

Please sign up or login with your details

Forgot password? Click here to reset