This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new

objects with 2D user interfaces is very difficult for non-experienced users. In this paper, we describe a system that uses semantic constraints to restrict object motion in a 3D scene, making interaction much simpler and more intuitive. We compare three different levels of semantic constraints in a 3D

techniques for object manipulation. Semantic constraints are introduced, which encapsulate such `common knowledge' about objects. Furthermore, we present a new way to automatically infer a scene hierarchy by dynamically grouping objects according to their constraint relationships. Keywords: Virtual

have explored the use of full syntactic analysis of the input, coupled with preference semantics. Preference semantics, as introduced by Wilks [31, penalizes but. does not reject analyses which violate semantic constraints; it selects the analysis with the lbwest constraint violations. The task

The main objective of database modelling is the design of a database that is correct and can be processed efficiently by a database management system. The efficiency and correctness of a database depends among other things on knowledge about database semantics because semantic constraints

in constraining the inferences that adult language users make about new words encountered in coniext. The results indicate that subjects applied implicit knowledge of constraints on possible word meanings in making and evaluating hypotheses about unfamiliar words encountered in context and suggest that implicit

and interpretation of-ung-nouns

and unfriendly system. Current tools normally offer a trade-off solution based on the introduction of some semantic constraints in the diagram editor to forbid a number of operations. To assert the correctness of the diagram, the user must explicitly request it to be checked. I believe this solution

, usually because they violate some liveness property. Therefore, a semantic constraint (sometimes called a fairness notion) is typically imposed on a given program to exclude undesirable computations that would otherwise be valid. Theoretically, there are infinitely many possible semantic constraints

To describe the concept of transitive trust in a simplified way, assume that agent trusts agent, and that agent trusts agent, then by transitivity, agent trusts agent. Trust transitivity manifests itself in various forms during real life human interaction, but can be challenging to concisely model in a formal way. In this paper we describe principles for expressing and analysing transitive trust networks, and define requirements for their validity. This framework can be used for modelling transitive trust in computerised interactions, and can be combined with algebras and algorithms for computing propagation of both trust and distrust. This is illustrated by an example where transitive trust is mathematically analysed with belief calculus. 1