Results 41 to 50 of about 20,008 (316)
Efficient Computation of the Well-Founded Semantics over Big Data [PDF]
Data originating from theWeb, sensor readings and social media result in increasingly huge datasets. The so called Big Data comes with new scientific and technological challenges while creating new opportunities, hence the increasing interest in academia
Faber, Wolfgang +2 more
core +1 more source
A metric for computational analysis of meaning [PDF]
A metric for assessing the complexity of semantic (and pragmatic) analysis in natural language processing is proposed as part of a general applied theory of linguistic semantics for NLP. The theory is intended as a complete projection of linguistic semantics onto NLP and is designed as an exhaustive list of possible choices among strategies of semantic
Sergei Nirenburg, Victor Raskin
openaire +2 more sources
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics [PDF]
Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code generation based on programming language semantics, particularly Horn logical semantics ...
Gopal Gupta +5 more
core +1 more source
Bootstrapping Optimization Techniques for the FINAL Fully Homomorphic Encryption Scheme
With the advent of cloud computing and the era of big data, there is an increasing focus on privacy computing. Consequently, homomorphic encryption, being a primary technique for achieving privacy computing, is held in high regard.
Meng Wu, Xiufeng Zhao, Weitao Song
doaj +1 more source
Elevated Connectivity During Language Processing Is Associated With Cognitive Performance in SeLECTS
ABSTRACT Objective Self‐Limited Epilepsy with Centrotemporal Spikes (SeLECTS) is associated with language impairments despite seizures originating in the motor cortex, suggesting aberrant cross‐network interactions. Here we tested whether functional connectivity in SeLECTS during language tasks predicts language performance.
Wendy Qi +8 more
wiley +1 more source
Relational and Allegorical Semantics for Constraint Logic Programming
El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de
Gallego Arias, Emilio Jesús
core +1 more source
Denotational semantics of recursive types in synthetic guarded domain theory [PDF]
Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for reasoning operationally about programming languages with advanced features including general ...
Møgelberg, Rasmus Ejlers; id_orcid +4 more
core +1 more source
ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source
Semantics and complexity of recursive aggregates in answer set programming
The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modelling power of ASP in terms of natural and concise problem representations.
Faber, Wolfgang +2 more
core +1 more source
Computing in matrix groups without memory [PDF]
Funding: UK Engineering and Physical Sciences Research Council award EP/K033956/1Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau +10 more
core +1 more source

