Results 1 to 10 of about 307,150 (181)
A Formalization of the Theorem of Existence of First-Order Most General Unifiers [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 This work presents a formalization of the theorem of existence of most general unifiers in first-order signatures in the higher-order proof assistant PVS.
Andréia B Avelar +3 more
doaj +4 more sources
Subsumption Demodulation in First-Order Theorem Proving [PDF]
Automated Reasoning10th International Joint Conference, 2020 Motivated by applications of first-order theorem proving to software analysis, we introduce a new inference rule, called subsumption demodulation, to improve support for reasoning with conditional equalities in superposition-based theorem proving. We show that subsumption demodulation is a simplification rule that does not require radical changes to ...
Gleiss B, Kovács L, Rath J.
europepmc +4 more sources
Linearized asymptotic stability for fractional differential equations [PDF]
Electronic Journal of Qualitative Theory of Differential Equations, 2016 We prove the theorem of linearized asymptotic stability for fractional differential equations. More precisely, we show that an equilibrium of a nonlinear Caputo fractional differential equation is asymptotically stable if its linearization at the ...
Nguyen Cong +3 more
doaj +4 more sources
Graphical representation of covariant-contravariant modal formulae [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Covariant-contravariant simulation is a combination of standard (covariant) simulation, its contravariant counterpart and bisimulation. We have previously studied its logical characterization by means of the covariant-contravariant modal logic. Moreover,
Miguel Palomino +4 more
doaj +8 more sources
First-order Logic Theorem Proving and Model Building via Approximation and Instantiation
, 2015 Counterexample-guided abstraction refinement is a well-established technique in verification. In this paper we instantiate the idea for first-order logic theorem proving. Given a clause set $N$ we propose its abstraction into a clause set $N'$ belonging to a decidable first-order fragment.
Teucke, A. +1 more
openaire +5 more sources
On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic [PDF]
Journal of Universal Computer Science, 2021 There are three main problems for theorem proving with a standard cut-free system for the first order minimal logic. The first problem is the possibility of looping. Secondly, it might generate proofs which are permutations of each other. Finally, during
Ashot Baghdasaryan, Hovhannes Bolibekyan
doaj +3 more sources
The uniqueness of the solution of an initial boundary value problem for a hyperbolic equation with a mixed derivative and a formula for the solution [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2023 An initial boundary value problem for an inhomogeneous second-order hyperbolic equation on a finite segment with constant coefficients and a mixed derivative is investigated. The case of fixed ends is considered.
Rykhlov, Victor Sergeyevich
doaj +1 more source
Mathematics, 2023 The present research aims to present new results regarding the fundamental problem of providing sufficient conditions for finding the best subordinant of a third-order differential superordination. A theorem revealing such conditions is first proved in a
Georgia Irina Oros +1 more
doaj +1 more source
Implementing Natural Language Inference for comparatives
Journal of Language Modelling, 2023 This paper presents a computational framework for Natural Language Inference (NLI) using logic-based semantic representations and theorem-proving. We focus on logical inferences with comparatives and other related constructions in English, which are ...
Izumi Haruta +2 more
doaj +1 more source
A Novel Combinational ATP Based on Contradiction Separation for First-Order Logic
International Journal of Computational Intelligence Systems, 2020 At present, most of the first-order logic theorem provers use a binary-resolution method, which can effectively solve the general first-order logic problems to a certain extent.
Jian Zhong, Yang Xu, Feng Cao
doaj +1 more source