Uniform Guarded Fragments

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

12 Downloads (Pure)

Abstract

In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem of uniform guarded fragment is NExpTime-complete.

Original languageEnglish
Title of host publicationFoundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings
EditorsPatricia Bouyer, Lutz Schröder
PublisherSpringer
Pages409-427
Number of pages19
ISBN (Print)9783030992521
DOIs
Publication statusPublished - 2022
Publication typeA4 Article in conference proceedings
EventEuropean Joint Conferences on Theory and Practice of Software - Munich, Germany
Duration: 4 Apr 20226 Apr 2022

Publication series

NameLecture Notes in Computer Science
Volume13242 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceEuropean Joint Conferences on Theory and Practice of Software
Country/TerritoryGermany
CityMunich
Period4/04/226/04/22

Keywords

  • Guarded fragment
  • Interpolation
  • Satisfiability problem

Publication forum classification

  • Publication forum level 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Uniform Guarded Fragments'. Together they form a unique fingerprint.

Cite this