Login / Signup
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable.
Matthias Horbach
Marco Voigt
Christoph Weidenbach
Published in:
CoRR (2017)
Keyphrases
</>
presburger arithmetic
quantifier elimination
datalog programs
algebraic structure
decision procedures
sufficient conditions
constraint propagation
database systems
user defined
deductive databases
model theoretic
constraint databases
functional programming
np complete
first order logic
satisfiability problem