English
Related papers

Related papers: Equational Bit-Vector Solving via Strong Gr\"obner…

200 papers

We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software. We develop delta-complete algorithms for SMT formulas that are…

Logic in Computer Science · Computer Science 2013-10-31 Sicun Gao , Soonho Kong , Edmund Clarke

We present foundational work on standard bases over rings and on Boolean Groebner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems…

Commutative Algebra · Mathematics 2008-02-04 Michael Brickenstein , Alexander Dreyer , Gert-Martin Greuel , Markus Wedler , Oliver Wienand

Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…

Computer Vision and Pattern Recognition · Computer Science 2024-01-18 Wanting Xu , Lan Hu , Manolis C. Tsakiris , Laurent Kneip

Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…

Symbolic Computation · Computer Science 2018-07-18 Gwen Spencer

We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisfiability modulo theory (SMT), using a mixture of a SAT solver…

Logic in Computer Science · Computer Science 2009-04-23 David Monniaux

The theory of quantifier-free bit-vectors (QF_BV) is of paramount importance in software verification. The standard approach for satisfiability checking reduces the bit-vector problem to a Boolean problem, leveraging the powerful SAT…

Logic in Computer Science · Computer Science 2017-06-29 Zakaria Chihani , François Bobot , Sébastien Bardin

Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an active area of research for SMT solvers. This paper introduces the first method to efficiently generate proofs of unsatisfiability specifically…

Logic in Computer Science · Computer Science 2024-04-19 Nick Feng , Alan J. Hu , Sam Bayless , Syed M. Iqbal , Patrick Trentin , Mike Whalen , Lee Pike , John Backes

With the advent of large language models (LLMs), numerous Post-Training Quantization (PTQ) strategies have been proposed to alleviate deployment barriers created by their enormous parameter counts. Quantization achieves compression by…

Machine Learning · Computer Science 2025-09-24 Wonjun Bang , Jongseok Park , Hongseung Yu , Kyungmin Bin , Kyunghan Lee

A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…

Number Theory · Mathematics 2007-05-23 P. Bantay , T. Gannon

In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…

Rings and Algebras · Mathematics 2017-04-11 Wolfram Decker , Christian Eder , Viktor Levandovskyy , Sharwan K. Tiwari

The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…

Spectral Theory · Mathematics 2022-09-20 Matthew J. Colbrook , Anders C. Hansen

In the last decade we have witnessed an impressive progress in the expressiveness and efficiency of Satisfiability Modulo Theories (SMT) solving techniques. This has brought previously-intractable problems at the reach of state-of-the-art…

Logic in Computer Science · Computer Science 2015-01-19 Roberto Sebastiani , Patrick Trentin

We prove that Bethe vectors generically form a base in a tensor product of irreducible heighest weight $gl_2$-modules or $U_q(gl_2)$-modules. We apply this result to difference equations with regular singular points. We show that if such an…

q-alg · Mathematics 2008-02-03 Vitaly Tarasov , Alexander Varchenko

In the presence of spin-orbit coupling, quantum models for semiconductor materials are generally not exactly solvable. As a result, understanding of the strong spin-orbit coupling effects in these systems remains poor. Here we develop an…

Mesoscale and Nanoscale Physics · Physics 2015-09-14 Rui Li , Lian-Ao Wu , Xuedong Hu , J. Q. You

Qualitative and quantitative aspects for variational inequalities governed by strongly pseudomonotone operators on Hilbert space are investigated in this paper. First, we establish a global error bound for the solution set of the given…

Optimization and Control · Mathematics 2020-10-07 Pham Tien Kha , Pham Duy Khanh

Many solid mechanics problems on complex geometries are conventionally solved using discrete boundary methods. However, such an approach can be cumbersome for problems involving evolving domain boundaries due to the need to track boundaries…

Numerical Analysis · Mathematics 2025-06-06 Vinamra Agrawal , Brandon Runnels

We present Integer Linear Programming (ILP) Modulo Theories (IMT). An IMT instance is an Integer Linear Programming instance, where some symbols have interpretations in background theories. In previous work, the IMT approach has been…

Logic in Computer Science · Computer Science 2013-04-09 Panagiotis Manolios , Vasilis Papavasileiou

Adversarial perturbations have drawn great attentions in various machine learning models. In this paper, we investigate the sample adversarial perturbations for nonlinear support vector machines (SVMs). Due to the implicit form of the…

Machine Learning · Computer Science 2022-06-14 Wen Su , Qingna Li

Metric space magnitude, an active field of research in algebraic topology, is a scalar quantity that summarizes the effective number of distinct points that live in a general metric space. The {\em weighting vector} is a closely-related…

Machine Learning · Computer Science 2021-06-03 Eric Bunch , Jeffery Kline , Daniel Dickinson , Suhaas Bhat , Glenn Fung

Optimization Modulo Theories (OMT) has emerged as an important extension of the highly successful Satisfiability Modulo Theories (SMT) paradigm. The OMT problem requires solving an SMT problem with the restriction that the solution must be…

Logic in Computer Science · Computer Science 2024-04-30 Nestan Tsiskaridze , Clark Barrett , Cesare Tinelli