Search results for "formal"
showing 10 items of 1654 documents
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
Los Estereotipos de género en las producciones audiovisuales: diseño y validación de la tabla de análisis EG_5x4
2022
Los productos culturales de la educación no formal, y en concreto los difundidos por televisión y plataformas streaming, incluidas no ficción y animación infantil, proponen entre sus figuraciones personajes estereotipados en su construcción de género. Según investigaciones previas, identificarlos y combatirlos favorece la erradicación de ideas sexistas relacionadas con violencias machistas. Por ello, el objetivo que se planteó fue diseñar y validar una tabla de análisis de estereotipos sexuales presentes en cualquier producto audiovisual. El proceso siguió un protocolo de 3 fases (Garrido et al., 2015): 1) Se revisó la literatura publicada, se extrajeron rasgos relacionados con estereotipos…
Learning by the Process of Elimination
2002
AbstractElimination of potential hypotheses is a fundamental component of many learning processes. In order to understand the nature of elimination, herein we study the following model of learning recursive functions from examples. On any target function, the learning machine has to eliminate all, save one, possible hypotheses such that the missing one correctly describes the target function. It turns out that this type of learning by the process of elimination (elm-learning, for short) can be stronger, weaker or of the same power as usual Gold style learning.While for usual learning any r.e. class of recursive functions can be learned in all of its numberings, this is no longer true for el…
A Fast Algorithm Finding the Shortest Reset Words
2013
In this paper we present a new fast algorithm for finding minimal reset words for finite synchronizing automata, which is a problem appearing in many practical applications. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare subsets. Also a number of heuristics are applied. We give both theoretical and practical arguments showing that the effective branching factor is considerably reduced. As a practical test we perform an experimental study of the length of the shortest …
Integer Weighted Regression Tsetlin Machines
2020
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in propositional logic to capture the underlying non-linear frequent patterns in the data. These, in turn, are combined into a continuous output through summation, akin to a linear regression function, however, with non-linear components and binary weights. However, the resolution of the RTM output is proportional to the number of clauses employed. This means that computation cost increases with resolution. To address this problem, we here introduce integer weighted RTM clauses. Our integer weighted clause is a compact r…
Automatic Calibration of an Industrial RGB-D Camera Network Using Retroreflective Fiducial Markers
2019
This paper describes a non-invasive, automatic, and robust method for calibrating a scalable RGB-D sensor network based on retroreflective ArUco markers and the iterative closest point (ICP) scheme. We demonstrate the system by calibrating a sensor network comprised of six sensor nodes positioned in a relatively large industrial robot cell with an approximate size of 10 m × 10 m × 4 m . Here, the automatic calibration achieved an average Euclidean error of 3 c m at distances up to 9.45 m . To achieve robustness, we apply several innovative techniques: Firstly, we mitigate the ambiguity problem that occurs when detecting a marker at long range or low resolution by comparing the…
Of Many, Many Other Things
2021
Propositions of everyday discourse can have, unlike those of formal languages, other components over and above the predicate and the terms needed to saturate it. These components are of two very different sorts: adverbs and further individual terms. Only adverbs have already been discussed by other writers in this connection; but they are not the whole story.
On Contextuality in Behavioral Data
2015
Dzhafarov, Zhang, and Kujala (Phil. Trans. Roy. Soc. A 374, 20150099) reviewed several behavioral data sets imitating the formal design of the quantum-mechanical contextuality experiments. The conclusion was that none of these data sets exhibited contextuality if understood in the generalized sense proposed in Dzhafarov, Kujala, and Larsson (Found. Phys. 7, 762-782, 2015), while the traditional definition of contextuality does not apply to these data because they violate the condition of consistent connectedness (also known as marginal selectivity, no-signaling condition, no-disturbance principle, etc.). In this paper we clarify the relationship between (in)consistent connectedness and (non…
Transformations that preserve learnability
1996
We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets.