Two variable logic with ultimately periodic counting
From MaRDI portal
Cites work
- A new description logic with set constraints and cardinality constraints on role successors
- Complexity of modal logics with Presburger constraints
- Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
- Complexity of the two-variable fragment with counting quantifiers
- Complexity Results for First-Order Two-Variable Logic with Counting
- Data-complexity of the two-variable fragment with counting quantifiers
- Fifty years of the spectrum problem: survey and new results
- On languages with two variables
- On the complexity of integer programming
- On the Decision Problem for Two-Variable First-Order Logic
- One-variable logic meets Presburger arithmetic
- Regular graphs and the spectra of two-variable logic with counting
- Satisfiability and query answering in description logics with global and local cardinality constraints
- The two-variable fragment with counting and equivalence
- The two-variable fragment with counting revisited
- Two-variable first-order logic with counting in forests
- Two-variable first-order logic with equivalence closure
- Two-variable logic with counting and trees
- Undecidability results on two-variable logics
Cited in
(2)
This page was built for publication: Two variable logic with ultimately periodic counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842458)
