Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Abstraction−based Satisfiabili...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Abstraction−based Satisfiability Solving of Presburger Arithmetic
Bibliographic Details
Main Authors:
Kroening, D
,
Ouaknine, J
,
Seshia, S
,
Strichman, O
Format:
Conference item
Published:
2004
Holdings
Description
Similar Items
Staff View
Similar Items
Deciding Bit−Vector Arithmetic with Abstraction
by: Bryant, R, et al.
Published: (2007)
On the decidability of Presburger arithmetic expanded with powers
by: Karimov, T, et al.
Published: (2025)
Beyond quantifier-free interpolation in extensions of presburger arithmetic
by: Brillout, A, et al.
Published: (2011)
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic.
by: Brillout, A, et al.
Published: (2011)
An interpolating sequent calculus for quantifier-free Presburger arithmetic
by: Brillout, A, et al.
Published: (2011)