English
Related papers

Related papers: The interpolant existence problem for weak K4 and …

200 papers

Craig interpolation in SMT is difficult because, e. g., theory combination and integer cuts introduce mixed literals, i. e., literals containing local symbols from both input formulae. In this paper, we present a scheme to compute Craig…

Logic in Computer Science · Computer Science 2017-05-16 Jürgen Christ , Jochen Hoenicke , Alexander Nutz

We give a solution to Pick's interpolation problem on the unit polydisc in $\mathbb{C}^n$, $n\geq 2$, by characterizing all interpolation data that admit a $\mathbb{D}$-valued interpolant, in terms of a family of positive-definite kernels…

Complex Variables · Mathematics 2019-12-20 Gautam Bharali , Vikramjeet Singh Chandel

We present a proof-theoretical study of the interpretability logic IL, providing a wellfounded and a non-wellfounded sequent calculus for IL. The non-wellfounded calculus is used to establish a cut elimination argument for both calculi. In…

Logic · Mathematics 2025-11-04 Sebastijan Horvat , Borja Sierra Miranda , Thomas Studer

We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has…

Optimization and Control · Mathematics 2013-06-10 Amir Ali Ahmadi , Alex Olshevsky , Pablo A. Parrilo , John N. Tsitsiklis

It is shown that rational dilation fails on broad collection of distinguished varieties associated to constrained subalgebras of the disk algebra of the form C + B A(D), where B is a finite Blaschke product with two or more zeros. This is…

Functional Analysis · Mathematics 2018-06-29 Michael A. Dritschel , Batzorig Undrakh

We consider Kirchhoff equations with strong damping, namely with a friction term which depends on a power of the "elastic" operator. We address local and global existence of solutions in two different regimes depending on the exponent in…

Analysis of PDEs · Mathematics 2014-08-19 Marina Ghisi , Massimo Gobbino

In this paper, we study a mixed wave-plate equation with rotational inertia, fractional damping and memory non-linearity. This research is a non-existence counterpart to a paper by D'Abbicco and Longen, in search of the critical exponent…

Analysis of PDEs · Mathematics 2025-09-09 Luis Gustavo Longen

We construct Lagrange interpolating polynomials for a set of points and values belonging to the algebra of real quaternions $H\simeq R_{0,2}$, or to the real Clifford algebra $R_{0,3}$. In the quaternionic case, the approach by means of…

Complex Variables · Mathematics 2018-07-02 Riccardo Ghiloni , Alessandro Perotti

We consider three equilibrium concepts proposed in the literature for time-inconsistent stopping problems, including mild equilibria, weak equilibria and strong equilibria. The discount function is assumed to be log sub-additive and the…

Probability · Mathematics 2022-11-04 Erhan Bayraktar , Zhenhua Wang , Zhou Zhou

We establish a consistency result by comparing two independent notions of generalised solutions to a large class of linear hyperbolic first order PDE systems with constant coefficients, showing that they eventually coincide. The first is…

Analysis of PDEs · Mathematics 2018-01-25 Nikos Katzourakis

Gurevich (1988) conjectured that there is no logic for $\textsf{P}$ or for $\textsf{NP}\cap \textsf{coNP}$. For the latter complexity class, he also showed that the existence of a logic would imply that $\textsf{NP} \cap \textsf{coNP}$ has…

Logic in Computer Science · Computer Science 2020-02-11 Anatole Dahan , Anuj Dawar

We consider the problem EnumIP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits. We study EnumIP from dec-DNNF within the framework of enumeration complexity…

Artificial Intelligence · Computer Science 2023-02-01 Alexis de Colnet , Pierre Marquis

Linear logical frameworks with subexponentials have been used for the specification of among other systems, proof systems, concurrent programming languages and linear authorization logics. In these frameworks, subexponentials can be…

Logic · Mathematics 2019-10-09 Max Kanovich , Stepan Kuznetsov , Vivek Nigam , Andre Scedrov

The monotone duality problem is defined as follows: Given two monotone formulas f and g in iredundant DNF, decide whether f and g are dual. This problem is the same as duality testing for hypergraphs, that is, checking whether a hypergraph…

Data Structures and Algorithms · Computer Science 2013-08-23 Georg Gottlob

We develop a Gentzen-style proof theory for super-Belnap logics (extensions of the four-valued Dunn-Belnap logic), expanding on an approach initiated by Pynko. We show that just like substructural logics may be understood…

Logic · Mathematics 2018-03-13 Adam Prenosil

In this paper, an algorithm for determining 3-colorability, i.e. the decision problem (YES/NO), in planar graphs is presented. The algorithm, although not exact (it could produce false positives) has two very important features: (i) it has…

Discrete Mathematics · Computer Science 2011-02-01 Jose Antonio Martin H

Interpolation is an important property of classical and many non-classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the the non-monotonic system of…

Logic in Computer Science · Computer Science 2014-01-17 Dov Gabbay , David Pearce , Agustín Valverde

We study the existence and uniqueness for weak solutions to some classes of anisotropic elliptic Dirichlet problems with data belonging to the natural dual space.

Analysis of PDEs · Mathematics 2013-02-27 R. Di Nardo , F. Feo

Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…

Optimization and Control · Mathematics 2024-05-24 Tracy Chin

The authors of ``A note on the complexity of a phaseless polynomial interpolation'' have shown that phaseless polynomial interpolation over $\mathbf{Q}$ is possible with $n+2$ points, where $n$ is the upper-bound on the degree of a…

Computational Complexity · Computer Science 2026-03-24 Michał R. Przybyłek , Paweł Siedlecki
‹ Prev 1 3 4 5 6 7 10 Next ›