Results 31 to 40 of about 307,150 (181)
Proving theorems by program transformation [PDF]
, 2013 In this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming ...
Fioravanti, Fabio +3 more
core +1 more source
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2016 Boundary Schwartz' problem for J-analytic functions was studied within this scientific work. These functions are solutions of linear complex system of partial differential equations of the first order. It was considered, that the real and imaginary parts
Vladimir G Nikolaev
doaj +1 more source
Automated verification of refinement laws [PDF]
, 2009 Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-weight variant of the refinement calculus, their intended semantics are positively disjunctive predicate transformers, and their calculus is entirely within ...
Hofner, P., Struth, G., Sutcliffe, G.
core +1 more source
Journal of High Energy Physics, 2021 Building on the recent derivation of a bare factorization theorem for the b-quark induced contribution to the h → γγ decay amplitude based on soft-collinear effective theory, we derive the first renormalized factorization theorem for a process described ...
Ze Long Liu +3 more
doaj +1 more source
IEEE Access, 2020 Next-generation transportation will be integrated, interconnected and highly autonomous. One key challenge in traffic management is ensuring safety while maintaining the required level of service quality.
Adnan Rashid +3 more
doaj +1 more source
New bound for Roth's theorem with generalized coefficients
Discrete Analysis, 2022 New bound for Roth's theorem with generalized coefficients, Discrete Analysis 2022:16, 21 pp. Roth's theorem states that for every $\delta>0$ there exists $n$ such that every subset of $\{1,2,\dots,n\}$ of size at least $\delta n$ contains an arithmetic
Cédric Pilatte
doaj +1 more source
Reasoning in the OWL 2 Full Ontology Language using First-Order Automated Theorem Proving
, 2011 OWL 2 has been standardized by the World Wide Web Consortium (W3C) as a family of ontology languages for the Semantic Web. The most expressive of these languages is OWL 2 Full, but to date no reasoner has been implemented for this language.
Schneider, Michael, Sutcliffe, Geoff
core +1 more source
The postulations á la D'Alembert and á la Cauchy for higher gradient continuum theories are equivalent. A review of existing results [PDF]
, 2015 In order to found continuum mechanics, two different postulations have been used. The first, introduced by Lagrange and Piola, starts by postulating how the work expended by internal interactions in a body depends on the virtual velocity field and its ...
DELL'ISOLA, Francesco +2 more
core +2 more sources
Quenched vs Annealed: Glassiness from SK to SYK
Physical Review X, 2020 We show that any Sachdev-Ye-Kitaev- (SYK) like model with finite-body interactions among local degrees of freedom, e.g., bosons or spins, has a fundamental difference from the standard fermionic model: The former model fails to be described by an ...
C. L. Baldwin, B. Swingle
doaj +1 more source
Graph Representations for Higher-Order Logic and Theorem Proving
, 2019 This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain.
Bansal, Kshitij +4 more
core +1 more source