Results 221 to 230 of about 51,918 (265)

Semantic distance and the verification of semantic relations

Journal of Verbal Learning and Verbal Behavior, 1973
Four experiments dealt with the verification of semantic relations. In Experiment I, subjects decided whether an instance was a member of a specified category. For some categories (for example, birds) verification was faster when the target category was a direct superordinate (bird) than a higher level superordinate (animal), while for another category
Lance J. Rips, Edward J. Shoben, Edward E. Smith   +2 more
openaire   +1 more source

Semantic field and accessibility relations

KES'2000. Fourth International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies. Proceedings (Cat. No.00TH8516), 2002
We give a fundamental definition of semantic fields and explain how accessibility relations can be related to semantic fields. The semantic field is then related to set theory, laws and facts, and Scott-Montague models.
Germano Resconi, T. Mura, Masaru Shimbo
openaire   +1 more source

Semantic relations in bilingual lexicons

ACM Transactions on Speech and Language Processing, 2008
Bilingual lexicons, essential to many NLP applications, can be constructed automatically on the basis of parallel or comparable corpora. In this article, we make two contributions to their induction from comparable corpora. The first one concerns the creation of these lexicons.
Yves Peirsman, Sebastian Padó
openaire   +1 more source

Relational Semantics

1997
Abstract Having solved the completeness problem, the algebraic semantics, introduced in the previous chapter, deprives us, however, of that transparent interpretation of logical connectives which made it possible to construct models for formulas by analyzing step by step their subformulas and adding new points, if necessary.
Alexander Chagrov, Michael Zakharyaschev
openaire   +1 more source

A Semantics for Relational Programming

1992
This paper presents an elementary model of relational programming as a generalisation of functional programming. We present well-known models of features of functional programming and show one way that they generalise to the relational case. This is achieved by giving a uniform construction of a category of types and relations from a category of types ...
openaire   +1 more source

Relation-based semantics for concurrency

Information Sciences, 1993
``Despite several decades of research, capturing the semantics of concurrent programs in a crisp and tractable fashion remains a formidable challenge''. With this ambitious goal the authors initiate their quest towards the clean and manageable concurrency semantics many have searched for before with more or less success.
Noureddine Boudriga, Yahya Slimani, Ali Mili 0001   +2 more
openaire   +2 more sources

Relational Semantics and Domain Semantics for Epistemic Modals

Journal of Philosophical Logic, 2016
The standard account of modal expressions in natural language analyzes them as quantifiers over a set of possible worlds determined by the evaluation world and an accessibility relation. A number of authors have recently argued for an alternative account according to which modals are analyzed as quantifying over a domain of possible worlds that is ...
openaire   +1 more source

Relational Scaling in Relational Semantic Systems

2009
In this paper two developments in Conceptual Knowledge Processing are combined, namely Contextual Logic introduced by Rudolf Wille and Temporal Concept Analysis introduced by the author. The basic structures connecting both theories are Relational Semantic Systems (RSS), each consisting of conceptual scales and a Relational Data Systems (RDS) for the ...
openaire   +1 more source

On the semantics of the relational data model

Proceedings of the 1975 ACM SIGMOD international conference on Management of data - SIGMOD '75, 1975
The relational model for data base organization introduced clearly defined basic algebraic concepts whose properties are well understood. As a consequence, questions of a semantic nature arise. Due to the mathematical nature of the relational model, these questions cannot be answered completely by it.
Hans Albrecht Schmid, J. Richard Swenson
openaire   +1 more source

On the Semantic Relation of Z and HOL

1998
We investigate the relation between the semantic models of Z, as proposed by the Z draft standard, and of the polymorphic version of higher-order logic that is the basis for proof systems such as HOL and Isabelle/HOL. Disregarding the names in schema types, the type models of the two systems can be identified up to isomorphism.
openaire   +1 more source