„Presburger arithmetic“
Suchergebnisse
1.000+ Treffer
-
On the Complexity and Expressiveness of Description Logics with Counting
-
Succinct Population Protocols for Presburger Arithmetic
-
Execution-Time Opacity Problems in One-Clock Parametric Timed Automata
-
Complexity of Presburger arithmetic with fixed quantifier dimension
-
Finite automata on unranked trees – extensions by arithmetical and equality constraints
-
Automata-based decision procedures for weak arithmetics
-
Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates
-
One-Parametric Presburger Arithmetic Has Quantifier Elimination
-
Large Flocks of Small Birds: on the Minimal Size of Population Protocols
-
Representation of Peano Arithmetic in Separation Logic
-
An Efficient Quantifier Elimination Procedure for Presburger Arithmetic
-
Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Linear Integer Arithmetic
-
Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures
-
The Complexity of Presburger Arithmetic with Power or Powers
-
Semilinear Representations for Series-Parallel Atomic Congestion Games
-
Higher-Order Quantified Boolean Satisfiability
-
Fast and Succinct Population Protocols for Presburger Arithmetic
-
Two Variable Logic with Ultimately Periodic Counting
-
Two-Way Parikh Automata
-
Reachability for Two-Counter Machines with One Test and One Reset