English
Related papers

Related papers: A Decision Procedure for Herbrand Formulae without…

200 papers

This paper proposes a homogeneous second-order descent framework (HSODF) for nonconvex and convex optimization based on the generalized homogeneous model (GHM). In comparison to the Newton steps, the GHM can be solved by extremal symmetric…

Optimization and Control · Mathematics 2025-05-13 Chang He , Yuntian Jiang , Chuwen Zhang , Dongdong Ge , Bo Jiang , Yinyu Ye

Although many programs have been published for fully numerical Hartree--Fock (HF) or density functional (DF) calculations on atoms, we are not aware of any that support hybrid DFs, which are popular within the quantum chemistry community…

Chemical Physics · Physics 2019-08-19 Susi Lehtola

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information of which instances…

Logic · Mathematics 2019-10-09 Federico Aschieri , Stefan Hetzl , Daniel Weller

This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives…

Logic in Computer Science · Computer Science 2019-03-14 Grigore Rosu

The best current methods for exactly computing the number of satisfying assignments, or the satisfying probability, of Boolean formulas can be seen, either directly or indirectly, as building 'decision-DNNF' (decision decomposable negation…

Databases · Computer Science 2013-09-27 Paul Beame , Jerry Li , Sudeepa Roy , Dan Suciu

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

This research was mainly conducted to explore the possibility of formulating an efficient algorithm to find roots of nonlinear equations without using the derivative of the function. The Weerakoon-Fernando method had been taken as the base…

Numerical Analysis · Mathematics 2021-02-05 S. L. Heenatigala , S. Weerakoon , T. G. I. Fernando

The minimization of propositional formulae is a classical problem in logic, whose first algorithms date back at least to the 1950s with the works of Quine and Karnaugh. Most previous work in the area has focused on obtaining minimal, or…

Artificial Intelligence · Computer Science 2023-03-14 Eduardo Calò , Jordi Levy

The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate $\mathsf{dp}_k(x_1,y_1,\ldots,x_k,y_k),$ expressing the existence of internally vertex-disjoint paths between $x_i$ and $y_i,$ for…

Logic in Computer Science · Computer Science 2024-02-28 Petr A. Golovach , Giannos Stamoulis , Dimitrios M. Thilikos

We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…

Exactly Solvable and Integrable Systems · Physics 2021-05-13 O. Cornejo-Perez , S. C. Mancas , H. C. Rosu , C. A. Rico-Olvera

In this paper, we present a new method for variable elimination in systems of inequations which is much faster than the Fourier-Motzkin Elimination (FME) method. In our method, a linear Diophantine problem is introduced which is dual to our…

Information Theory · Computer Science 2011-02-15 Farhad Shirani Chaharsooghi , Mohammad Javad Emadi , Mahdi Zamanighomi , Mohammad Reza Aref

We present a semi-decision procedure to tackle first order differential equations, with Liouvillian functions in the solution (LFOODEs). As in the case of the Prelle-Singer procedure, this method is based on the knowledge of the integrating…

Mathematical Physics · Physics 2008-10-02 L. G. S. Duarte , S. E. S. Duarte , L. A. C. P. da Mota

Suppose that $\Phi$ is a consistent sentence. Then there is no Herbrand proof of $\neg \Phi$, which means that any Herbrand disjunction made from the prenex form of $\neg \Phi$ is falsifiable. We show that the problem of finding such a…

Logic in Computer Science · Computer Science 2014-11-14 Pavel Pudlak

This paper studies adaptive first-order least-squares finite element methods for second-order elliptic partial differential equations in non-divergence form. Unlike the classical finite element method which uses weak formulations of PDEs…

Numerical Analysis · Mathematics 2019-06-28 Weifeng Qiu , Shun Zhang

In this paper we extend a decision procedure for the Boolean algebra of finite sets with cardinality constraints ($\mathcal{L}_{\lvert\cdot\rvert}$) to a decision procedure for $\mathcal{L}_{\lvert\cdot\rvert}$ extended with set terms…

Logic in Computer Science · Computer Science 2026-05-05 Maximiliano Cristiá , Gianfranco Rossi

Composite federated learning offers a general framework for solving machine learning problems with additional regularization terms. However, existing methods often face significant limitations: many require clients to perform…

Machine Learning · Computer Science 2025-12-12 Yuan Zhou , Jiachen Zhong , Xinli Shi , Guanghui Wen , Xinghuo Yu

Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…

chao-dyn · Physics 2009-10-28 W. H. Warner , P. R. Sethna , James P. Sethna

In this paper we propose a collocation method for solving some well-known classes of Lane-Emden type equations which are nonlinear ordinary differential equations on the semi-infinite domain. They are categorized as singular initial value…

Mathematical Physics · Physics 2011-11-10 K. Parand , Mehdi Dehghan , A. R. Rezaei , S. M. Ghaderi

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

Logic in Computer Science · Computer Science 2014-04-15 Fabio Mogavero , Giuseppe Perelli

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…

Computational Complexity · Computer Science 2020-01-08 Susanna F. de Rezende , Or Meir , Jakob Nordström , Toniann Pitassi , Robert Robere , Marc Vinyals