Imagen de Portada

Modulo quantifiers over functional vocabularies extending addition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Baskar, A., Sreejith, A. V., Thinniyam, R. S.
Formato:	Preprint
Publicado:	2017
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

Regular expressions over countable words
por: Colcombet, Thomas, et al.
Publicado: (2025)

On Presburger arithmetic extended with non-unary counting quantifiers
por: Habermehl, Peter, et al.
Publicado: (2022)

Existential Definability over the Subword Ordering
por: Baumann, Pascal, et al.
Publicado: (2022)

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
por: Aceto, Luca, et al.
Publicado: (2025)

The complete classification for quantified equality constraints
por: Zhuk, Dmitriy, et al.
Publicado: (2021)

General Decidability Results for Systems with Continuous Counters
por: Balasubramanian, A. R., et al.
Publicado: (2025)

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

Generalized Optimization Modulo Theories
por: Tsiskaridze, Nestan, et al.
Publicado: (2024)

Congruence Closure Modulo Groups
por: Kim, Dohan
Publicado: (2023)

On matrix rank function over bounded arithmetics
por: Ken, Eitetsu, et al.
Publicado: (2023)

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

Satisfiability Modulo Theories for Verifying MILP Certificates
por: Wood, Kenan, et al.
Publicado: (2023)

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

Integer Reasoning Modulo Different Constants in SMT
por: Pertseva, Elizaveta, et al.
Publicado: (2025)

Rewriting Modulo Traced Comonoid Structure
por: Ghica, Dan R., et al.
Publicado: (2023)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
por: Preiner, Mathias, et al.
Publicado: (2026)

DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
por: Feng, Nick, et al.
Publicado: (2024)

An Effective Orchestral Approach to Satisfiability Modulo Prime Fields
por: Isabel, Miguel, et al.
Publicado: (2026)

Proofs for Free in the $λΠ$-Calculus Modulo Theory
por: Traversié, Thomas
Publicado: (2024)

Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)
por: Caires-Santos, Ali K., et al.
Publicado: (2025)

Kuroda's Translation for the $λΠ$-Calculus Modulo Theory and Dedukti
por: Traversié, Thomas
Publicado: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search
por: Lipparini, Enrico, et al.
Publicado: (2025)

From Rewrite Rules to Axioms in the $λ$$Π$-Calculus Modulo Theory
por: Blot, Valentin, et al.
Publicado: (2024)

ocLTL: LTL Realizability and Synthesis Modulo ω-Categorical Structures
por: Asor, Ohad
Publicado: (2026)

Case Study: Verified Vampire Proofs in the LambdaPi-calculus Modulo
por: Komel, Anja Petković, et al.
Publicado: (2025)

Nominal semantics for predicate logic: algebras, substitution, quantifiers, and limits
por: Dowek, Gilles, et al.
Publicado: (2023)

A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version)
por: Faella, Marco, et al.
Publicado: (2024)

A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
por: Grabmayer, Clemens
Publicado: (2022)

An extended type system with lambda-typed lambda-expressions (extended version)
por: Weber, Matthias
Publicado: (2018)

The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete
por: Bozzelli, L., et al.
Publicado: (2022)

Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version)
por: Stramaglia, Anna, et al.
Publicado: (2025)

Canonical Decision Diagrams Modulo Theories
por: Michelutti, Massimo, et al.
Publicado: (2024)

Benchmarks for Parity Games (extended version)
por: Keiren, Jeroen J. A.
Publicado: (2014)

Arity hierarchies for quantifiers closed under partial polymorphisms
por: Dawar, Anuj, et al.
Publicado: (2025)

Confluence of Conditional Rewriting Modulo
por: Lucas, Salvador
Publicado: (2025)

A Coq Formalization of Unification Modulo Exclusive-Or
por: Xu, Yichi, et al.
Publicado: (2025)

Unary counting quantifiers do not increase the expressive power of Presburger aritmetic: an alternative shorter proof
por: Choffrut, Christian
Publicado: (2024)

Neuro-Symbolic Constrained Optimization for Cloud Application Deployment via Graph Neural Networks and Satisfiability Modulo Theory
por: Erascu, Madalina
Publicado: (2025)

Heterogeneous Dynamic Logic: Provability Modulo Program Theories
por: Teuber, Samuel, et al.
Publicado: (2025)