Results 21 to 30 of about 126,488 (157)

Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics [PDF]

open access: yesLogic in Computer Science, 2022
Semiring semantics evaluates logical statements by values in some commutative semiring (K, +, ·, 0, 1). Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how
E. Grädel   +3 more
semanticscholar   +1 more source

Parameterized Complexity of Elimination Distance to First-Order Logic Properties [PDF]

open access: yesLogic in Computer Science, 2021
The elimination distance to some target graph property ${\mathcal{P}}$ is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic.
F. Fomin, P. Golovach, D. Thilikos
semanticscholar   +1 more source

First-order Logic with Connectivity Operators [PDF]

open access: yesAnnual Conference for Computer Science Logic, 2021
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size.
Nicole Schirrmacher   +2 more
semanticscholar   +1 more source

Constrained Expressions and their Derivatives [PDF]

open access: yesFundamenta Informaticae, 2014
This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These expressions are called constrained expressions.
Jean-Marc Champarnaud   +2 more
semanticscholar   +1 more source

Combinatorial Proofs and Decomposition Theorems for First-order Logic [PDF]

open access: yesLogic in Computer Science, 2021
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a syntax-free ...
Dominic J. D. Hughes   +2 more
semanticscholar   +1 more source

THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC [PDF]

open access: yesJournal of Symbolic Logic (JSL), 2021
We prove that the first-order logic of CZF is intuitionistic first-order logic. To do so, we introduce a new model of transfinite computation (Set Register Machines) and combine the resulting notion of realisability with Beth semantics.
Robert Passmann
semanticscholar   +1 more source

Positive First-order Logic on Words [PDF]

open access: yesLogic in Computer Science, 2021
We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+.
Denis Kuperberg
semanticscholar   +1 more source

Technical Note: Using Machine Learning to Predict Locomotor Behavior in Great Apes and Humans From Femur Metaphyseal Shape. [PDF]

open access: yesAm J Biol Anthropol
ABSTRACT Objectives The morphology of the hominoid distal femoral metaphyseal surface has been demonstrated to reflect locomotor behavior throughout ontogeny. Here, we quantify metaphyseal surface morphology to evaluate its predictive relationship to locomotor behavioral modes in hominoids.
Stamos PA   +3 more
europepmc   +2 more sources

A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learning: Principals, Recent Advances, and Applications [PDF]

open access: yesIEEE Signal Processing Magazine, 2020
Zeroth-order (ZO) optimization is a subset of gradient-free optimization that emerges in many signal processing and machine learning (ML) applications. It is used for solving optimization problems similarly to gradient-based methods. However, it does not
Sijia Liu   +5 more
semanticscholar   +1 more source

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization

open access: yesMathematics of Operations Research, 2022
We consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in Euclidean space, where the task is to solve Riemannian optimization problems with only noisy objective function evaluations.
Jiaxiang Li   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy