Analysis of logics with arithmetic
From MaRDI portal
Cites work
- A new polynomial-time algorithm for linear programming
- Carathéodory bounds for integer cones
- Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
- Complexity of the two-variable fragment with counting quantifiers
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- Logics in Artificial Intelligence
- On Context-Free Languages
- On the complexity of integer programming
- On two-variable guarded fragment logic with expressive local Presburger constraints
- One-variable logic meets Presburger arithmetic
- Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests
- Presburger Büchi tree automata with applications to logics with expressive counting
- Presburger concept cardinality constraints in very expressive description logics. Allegro sexagenarioso ma non ritardando
- Regular graphs and the spectra of two-variable logic with counting
- Two variable logic with ultimately periodic counting
This page was built for publication: Analysis of logics with arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445681)