Imagen de Portada

Integer Linear-Exponential Programming in NP by Quantifier Elimination

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chistikov, Dmitry, Mansutti, Alessio, Starchak, Mikhail R.
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

One-Parametric Presburger Arithmetic has Quantifier Elimination
por: Mansutti, Alessio, et al.
Publicado: (2025)

Optimization Modulo Integer Linear-Exponential Programs
por: Hitarth, S, et al.
Publicado: (2025)

The complexity of Presburger arithmetic with power or powers
por: Benedikt, Michael, et al.
Publicado: (2023)

On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number
por: Gallego-Hernández, Jorge, et al.
Publicado: (2025)

Intersecting Dense Automata
por: Chistikov, Dmitry, et al.
Publicado: (2026)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
por: Benedikt, Michael, et al.
Publicado: (2026)

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
por: Accattoli, Beniamino
Publicado: (2022)

Satisfiability Modulo Exponential Integer Arithmetic
por: Frohn, Florian, et al.
Publicado: (2024)

On Efficient Algorithms For Partial Quantifier Elimination
por: Goldberg, Eugene
Publicado: (2024)

Partial Quantifier Elimination By Certificate Clauses
por: Goldberg, Eugene
Publicado: (2020)

Pseudo-Complex Quantifier Elimination
por: Faroß, Nicolas, et al.
Publicado: (2026)

Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming
por: Castro, Pablo F.
Publicado: (2026)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
por: Haase, Christoph, et al.
Publicado: (2024)

An Expansion-Based Approach for Quantified Integer Programming
por: Hartisch, Michael, et al.
Publicado: (2025)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
por: Goldberg, Eugene
Publicado: (2024)

MCSAT Modulo Transcendental Arithmetics
por: Gallego-Hernández, Jorge, et al.
Publicado: (2026)

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
por: Lommen, Nils, et al.
Publicado: (2022)

IMELL Cut Elimination with Linear Overhead
por: Accattoli, Beniamino, et al.
Publicado: (2024)

Quantifier Elimination Meets Treewidth
por: Wu, Hao, et al.
Publicado: (2026)

Quantifier Elimination and Craig Interpolation, Quantitatively
por: Batz, Kevin, et al.
Publicado: (2025)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
por: Amat, Nicolas, et al.
Publicado: (2024)

Invariants for One-Counter Automata with Disequality Tests
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Variable Elimination as Rewriting in a Linear Lambda Calculus
por: Ehrhard, Thomas, et al.
Publicado: (2025)

Programs Versus Finite Tree-Programs
por: Moshkov, Mikhail
Publicado: (2025)

Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
por: Acclavio, Matteo, et al.
Publicado: (2023)

Targeting Completeness: Automated Complexity Analysis of Integer Programs
por: Lommen, Nils, et al.
Publicado: (2024)

Modular Automatic Complexity Analysis of Recursive Integer Programs
por: Lommen, Nils, et al.
Publicado: (2025)

Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification
por: Hozzová, Petra, et al.
Publicado: (2024)

Constructive Ordinal Exponentiation
por: de Jong, Tom, et al.
Publicado: (2025)

On the Cut Elimination of Weak Intuitionistic Tense Logic
por: Wang, Yiheng, et al.
Publicado: (2024)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
por: Lommen, Nils, et al.
Publicado: (2023)

Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic (Technical Report)
por: Habermehl, Peter, et al.
Publicado: (2024)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Recursive Program Synthesis from Sketches and Mixed-Quantifier Properties
por: Egolf, Derek, et al.
Publicado: (2026)

FLINGO -- Instilling ASP Expressiveness into Linear Integer Constraints
por: Fandinno, Jorge, et al.
Publicado: (2026)

Linear Programming in Isabelle/HOL
por: Parsert, Julian
Publicado: (2024)

Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops
por: Nakamura, Yoshiki
Publicado: (2025)

Satisfiability for Knowing How over Linear Plans is NP-complete
por: Areces, Carlos, et al.
Publicado: (2026)

Modelling of logical systems by means of their fragments
por: Rybakov, Mikhail
Publicado: (2025)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
por: Lichtner, Kilian, et al.
Publicado: (2025)