English
Related papers

Related papers: Weighted First-Order Model Counting in the Two-Var…

200 papers

Using canonical quantisation, and eschewing the Schwinger-Keldysh path integral, we derive a version of the Worldline Quantum Field Theory (WQFT) formalism suitable for both scattering and bound configurations of the classical two-body…

High Energy Physics - Theory · Physics 2026-03-06 Riccardo Gonzo , Gustav Mogull

In this paper we study the commutators of fractional type integral operators. This operators are given by kernels of theform $$K(x,y)=k_1(x-A_1y)k_2(x-A_2y)\dots k_m(x-A_my),$$ where $A_i$ are invertibles matrices and each $k_i$ satisfies a…

Classical Analysis and ODEs · Mathematics 2018-04-27 Gonzalo H. Ibañez-Firnkorn , María Silvina Riveros

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

In our setting enumeration amounts to generate all solutions of a problem instance without duplicates. We address the problem of enumerating the models of B-formulae. A B-formula is a propositional formula whose connectives are taken from a…

Computational Complexity · Computer Science 2016-12-05 Johannes Schmidt

We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.

Logic · Mathematics 2013-03-12 Toshiyasu Arai

We introduce the notion of the \emph{first-order part} of a problem in the Weihrauch degrees. Informally, the first-order part of a problem $\mathsf{P}$ is the strongest problem with codomaixn $\omega$ that is Weihrauch reducible to…

Logic · Mathematics 2023-01-31 Damir D. Dzhafarov , Reed Solomon , Keita Yokoyama

The solvability in $W^{2}_{p}(\bR^{d})$ spaces is proved for second-order elliptic equations with coefficients which are measurable in one direction and VMO in the orthogonal directions in each small ball with the direction depending on the…

Analysis of PDEs · Mathematics 2008-10-29 N. V. Krylov

We develop and analyse a first-order algorithm for the A-optimal experimental design problem. The problem is first presented as a special case of a parametric family of optimal design problems for which duality results and optimality…

Computation · Statistics 2013-11-12 Selin Damla Ahipasaoglu

This work extends the existing MACE-style finite model finding approach to multi-sorted first order logic. This existing approach iteratively assumes increasing domain sizes and encodes the related ground problem as a SAT problem. When…

Logic in Computer Science · Computer Science 2016-04-28 Giles Reger , Martin Suda , Andrei Voronkov

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient…

Machine Learning · Statistics 2016-10-17 Mathieu Blondel , Akinori Fujino , Naonori Ueda , Masakazu Ishihata

This is the second component of a two-part paper dealing with a unification of characteristic mode decomposition. This second part addresses modal tracking and losses and presents several numerical examples for both surface- and…

Classical Physics · Physics 2023-01-04 Mats Gustafsson , Lukas Jelinek , Kurt Schab , Miloslav Capek

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…

Formal Languages and Automata Theory · Computer Science 2015-04-30 Zoltán Fülöp , Heiko Vogler

The assignment of weights to attacks in a classical Argumentation Framework allows to compute semantics by taking into account the different importance of each argument. We represent a Weighted Argumentation Framework by a non-binary…

Artificial Intelligence · Computer Science 2018-10-04 Stefano Bistarelli , Alessandra Tappini , Carlo Taticchi

We propose a general framework for finding the ground state of many-body fermionic systems by using feed-forward neural networks. The anticommutation relation for fermions is usually implemented to a variational wave function by the Slater…

Strongly Correlated Electrons · Physics 2021-12-21 Koji Inui , Yasuyuki Kato , Yukitoshi Motome

The paper develops a second-order time-domain moment matching framework for the structure-preserving model reduction of second-order dynamical systems of high dimension, avoiding the first-order double-sized equivalent system. The moments…

Optimization and Control · Mathematics 2026-01-01 Xiaodong Cheng , Tudor C. Ionescu

It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…

Logic in Computer Science · Computer Science 2023-07-06 Jan Dreier , Daniel Mock , Peter Rossmanith

This work discuss the construction of braneworld solutions in modified gravity with Lagrange multipliers. We examine the general aspects of the model and present a first order formalism that help us to find analytic solutions of the…

High Energy Physics - Theory · Physics 2020-02-19 D. Bazeia , D. A. Ferreira , D. C. Moreira

In this work, we investigate an inverse problem of recovering multiple orders in a time-fractional diffusion model from the data observed at one single point on the boundary. We prove the unique recovery of the orders together with their…

Numerical Analysis · Mathematics 2021-11-17 Bangti Jin , Yavar Kian

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman