AI Chat AI Image Generator AI Video Text to Speech

The One-Variable Logic Meets Presburger Arithmetic

10/25/2018

∙

by Bartosz Bednarczyk, et al.

∙

∙

We consider the one-variable fragment of first-order logic extended with Presburger constraints. The logic is designed in such a way that it subsumes the previously-known fragments extended with counting, modulo counting or cardinality comparison and combines their expressive power. We prove NP-completeness of the logic by presenting an optimal algorithm for solving its finite satisfiability problem.

page 1

page 2

page 3

page 4

research

∙ 01/21/2021

Finite Model Theory of the Triguarded Fragment and Related Logics

The Triguarded Fragment (TGF) is among the most expressive decidable fra...

0 Emanuel Kieronski, et al. ∙

research

∙ 05/24/2023

Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates

First-order logic fragments mixing quantifiers, arithmetic, and uninterp...

0 Bernard Boigelot, et al. ∙

research

∙ 10/16/2017

Modulo Counting on Words and Trees

We consider the satisfiability problem for the two-variable fragment of ...

0 Bartosz Bednarczyk, et al. ∙

research

∙ 12/30/2021

Expressive power versus decidability

In this note we prove that there exists no fragment of first-order logic...

0 Reijo Jaakkola, et al. ∙

research

∙ 10/06/2021

One-Dimensional Fragment over Words and Trees

One-dimensional fragment of first-order logic is obtained by restricting...

0 Emanuel Kieronski, et al. ∙

research

∙ 06/01/2020

Two variable logic with ultimately periodic counting

We consider the extension of two variable logic with quantifiers that st...

0 Michael Benedikt, et al. ∙

research

∙ 02/20/2023

Weighted First Order Model Counting with Directed Acyclic Graph Axioms

Statistical Relational Learning (SRL) integrates First-Order Logic (FOL)...

0 Sagar Malhotra, et al. ∙