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

DOI10.46298/LMCS-20(3:16)2024MaRDI QIDQ6597967

Chia-Hsuan Lu, Tony Tan

Publication date: 4 September 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

satisfiabilityEXP-completelocal counting constraintstwo-variable guarded fragment

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modal languages and bounded fragments of predicate logic
• One-variable logic meets Presburger arithmetic
• Carathéodory bounds for integer cones
• Complexity of the two-variable fragment with counting quantifiers
• Complexity of modal logics with Presburger constraints
• An Introduction to Description Logic
• Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
• The two‐variable fragment with counting and equivalence
• On the complexity of integer programming
• Alternation
• The Härtig quantifier: a survey
• On the Decision Problem for Two-Variable First-Order Logic
• On the Restraining Power of Guards
• Regular Graphs and the Spectra of Two-Variable Logic with Counting
• Presburger Büchi tree automata with applications to logics with expressive counting

This page was built for publication: On two-variable guarded fragment logic with expressive local Presburger constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597967)