scientific article; zbMATH DE number 7799614

DOI10.4230/LIPICS.FSTTCS.2021.36MaRDI QIDQ6187052zbMATH OpenFDO

Authors Bartosz Bednarczyk, Tony Tan

Publication date 5 February 2024

Full work available at URL https://arxiv.org/abs/2106.15250

zbMATH Keywords

(un)decidabilityfragments of first-order logicguarded fragmentknowledge representationsatisfiabilitystatistical reasoningtwo-variable fragment

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(7)

• Two variable logic with ultimately periodic counting
• On two-variable guarded fragment logic with expressive local Presburger constraints
• Decidable (ac)counting with Parikh and Muller: adding Presburger arithmetic to monadic second-order logic over tree-interpretable structures
• Decidability of graph neural networks via logical characterizations
• Axiomatization of modal logic with counting
• A characterisation theorem for two-way bisimulation-invariant monadic least fixpoint logic over finite structures
• On homogeneous models of fluted languages

This page was built for publication:

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