Results 1 to 10 of about 40,356,300 (290)

A Double Team Semantics for Generalized Quantifiers [PDF]

open access: yesJournal of Logic, Language and Information, 2015
We define a semantics for first-order logic with generalized quantifiers based on double teams. We also define and investigate a notion of a generalized atom. Such atoms can be used in order to define extensions of first-order logic with a team-based semantics. We also define a game semantics and compare it with the double team semantics.
Antti Kuusisto
exaly   +9 more sources

Upwards Closed Dependencies in Team Semantics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
We prove that adding upwards closed first-order dependency atoms to first-order logic with team semantics does not increase its expressive power (with respect to sentences), and that the same remains true if we also add constancy atoms. As a consequence,
Pietro Galliani
doaj   +7 more sources

Tractability Frontier of Data Complexity in Team Semantics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
We study the data complexity of model-checking for logics with team semantics. For dependence and independence logic, we completely characterize the tractability/intractability frontier of data complexity of both quantifier-free and quantified formulas ...
Arnaud Durand   +3 more
doaj   +8 more sources

Safe Dependency Atoms and Possibility Operators in Team Semantics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added to it.
Pietro Galliani
doaj   +8 more sources

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics [PDF]

open access: yesLogical Methods in Computer Science, 2021
We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables the handling and
Matthias Hoelzel, Richard Wilke
doaj   +1 more source

The Effective Coverage of Homogeneous Teams with Radial Attenuation Models

open access: yesSensors, 2022
For the area coverage (e.g., using a WSN), despite the comprehensive research works on full-plane coverage using a multi-node team equipped with the ideal constant model, only very few works have discussed the coverage of practical models with varying ...
Yuan-Rui Yang, Qiyu Kang, Rui She
doaj   +1 more source

Training, Abilities and the Structure of Teams

open access: yesGames, 2023
Training in firms has an effect on the productivity of employees who receive the training, and depending on the production technology, on the other employees as well.
Tobias Hiller
doaj   +1 more source

Using Optical Tracking System Data to Measure Team Synergic Behavior: Synchronization of Player-Ball-Goal Angles in a Football Match

open access: yesSensors, 2020
The ecological dynamics approach to interpersonal relationships provides theoretical support to the use of kinematic data, obtained with sensor-based systems, in which players of a team are linked mainly by information from the performance environment ...
Daniel Carrilho   +5 more
doaj   +1 more source

Ontology-based Knowledge System and Team Verification Tool for Competitive Pokemon

open access: yesProceedings of the International Florida Artificial Intelligence Research Society Conference, 2021
Competitive Pokemon is a domain with rich semantics and complex relationships between its elements. Current research in the domain has focused on developing AI agents to select moves within a match, ignoring the problem of team building.
Daniel Verdear, Ubbo Visser
doaj   +1 more source

Characterizing Strongly First Order Dependencies: The Non-Jumping Relativizable Case [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2019
Team Semantics generalizes Tarski's Semantics for First Order Logic by allowing formulas to be satisfied or not satisfied by sets of assignments rather than by single assignments.
Pietro Galliani
doaj   +1 more source

Home - About - Disclaimer - Privacy