Results 61 to 70 of about 166,773 (130)
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems [PDF]
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p system, which allows for local inconsistency handling. We then characterise the
Franconi, Enrico +3 more
core +3 more sources
Semantics of a Typed Algebraic Lambda-Calculus
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space.
Andrzej Filinski +20 more
core +2 more sources
Meinongian Semantics and Artificial Intelligence
This essay describes computational semantic networks for a philosophical audience and surveys several approaches to semantic-network semantics. In particular, propositional semantic networks (exemplified by SNePS) are discussed; it is argued that only a ...
William J. Rapaport
doaj
Scalability using effects [PDF]
This note is about using computational effects for scalability. With this method, the specification gets more and more complex while its semantics gets more and more correct.
Duval, Dominique
core +1 more source
On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks [PDF]
We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks.
Strass, Hannes
core
A Quantum Computational Semantics for Epistemic Logical Operators. Part I: Epistemic Structures [PDF]
Enrico G. Beltrametti +4 more
openalex +3 more sources
Context Semantics, Linear Logic and Computational Complexity
We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity: it is both an
Lago, Ugo Dal
core +3 more sources
Modular Labelled Sequent Calculi for Abstract Separation Logics
separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are "abstract" because they are independent of any particular concrete resource model.
Clouston, Ranald +3 more
core +1 more source
Intuitionistic computability logic [PDF]
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic.
Japaridze, Giorgi
core +2 more sources
Our study deals with the systematic construction of the structural representation of meaning, as it is based on a basic topic, which is structure, as it goes beyond the representation of meaning for its parts, as logical representations are usually used
Aida Haouchi
doaj

