Results 1  10
of
154
Constraint Hierarchies
 LISP AND SYMBOLIC COMPUTATION
, 1992
"... Constraints allow programmers and users to state declaratively a relation that should be maintained, rather than requiring them to write procedures to maintain the relation themselves. They are thus useful in such applications as programming languages, user interface toolkits, and simulation package ..."
Abstract

Cited by 144 (14 self)
 Add to MetaCart
Constraints allow programmers and users to state declaratively a relation that should be maintained, rather than requiring them to write procedures to maintain the relation themselves. They are thus useful in such applications as programming languages, user interface toolkits, and simulation packages. In many situations, it is desirable to be able to state both required and preferential constraints. The required constraints must hold. Since the other constraints are merely preferences, the system should try to satisfy them if possible, but no error condition arises if it cannot. A constraint hierarchy consists of a set of constraints, each labeled as either required or preferred at some strength. An arbitrary number of different strengths is allowed. In the discussion of a theory of constraint hierarchies, we present alternate ways of selecting among competing possible solutions, and prove a number of propositions about the relations among these alternatives. We then outline algorit...
A UNIFYING FIELD IN LOGICS: NEUTROSOPHIC LOGIC. NEUTROSOPHY, NEUTROSOPHIC SET, NEUTROSOPHIC PROBABILITY AND STATISTICS (fourth edition)
, 2005
"... ..."
Hierarchical Constraint Logic Programming
, 1993
"... A constraint describes a relation to be maintained ..."
Abstract

Cited by 67 (3 self)
 Add to MetaCart
A constraint describes a relation to be maintained
Constraint Hierarchies and Logic Programming
, 1989
"... Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, as well as most other constraint systems, only allow the programmer to specify constraints that must hold ..."
Abstract

Cited by 67 (5 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, as well as most other constraint systems, only allow the programmer to specify constraints that must hold. In many applications, such as interactive graphics, page layout, and decision support, one needs to express preferences as well as strict requirements. If we wish to make full use of the constraint paradigm, we need ways to represent these defaults and preferences declaratively, as constraints, rather than encoding them in the procedural parts of the language. We describe a scheme for extending CLP(D) to include both required and preferential constraints, with an arbitrary number of strengths of preference. We present some of the theory of such languages, and an algorithm for executing them. To test our ideas, we have implemented an interpreter for an instance of this language scheme with D equal to the reals. We describe our interpreter, and outline some examples of using this language.
Belief Functions and Default Reasoning
, 2000
"... We present a new approach to deal with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' epsilon semantics, are epsilonbelief assignments, where mass values are either close to 0 or close to 1. In the first part of this paper, we show that t ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
We present a new approach to deal with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' epsilon semantics, are epsilonbelief assignments, where mass values are either close to 0 or close to 1. In the first part of this paper, we show that these structures can be used to give a uniform semantics to several popular nonmonotonic systems, including Kraus, Lehmann and Magidor's system P, Pearl's system Z, Brewka's preferred subtheories, Geffner's conditional entailment, Pinkas' penalty logic, possibilistic logic and the lexicographic approach. In the second part, we use epsilonbelief assignments to build a new system, called LCD, and show that this system correctly addresses the wellknown problems of specificity, irrelevance, blocking of inheritance, ambiguity, and redundancy.
Polyhedral Modeling With Multiprecision Integer Arithmetic
, 1996
"... this paper appeared in the Third Symposium on Solid Modeling and Applications [7]. ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
this paper appeared in the Third Symposium on Solid Modeling and Applications [7].
Combinatorics of nonabelian gerbes with connection and curvature
, 203
"... Abstract: We give a functorial definition of Ggerbes over a simplicial complex when the local symmetry group G is nonAbelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a fibered category equipped with a functorial connectio ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
Abstract: We give a functorial definition of Ggerbes over a simplicial complex when the local symmetry group G is nonAbelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a fibered category equipped with a functorial connection over the space of edgepaths. By computing the curvature of the latter on the faces of an infinitesimal 4simplex, we recover the cocycle identities satisfied by the curvature of this gerbe. The link with BFtheories suggests that gerbes provide a framework adapted to the geometric formulation of strongly coupled gauge theories.
Measurement Of Membership Functions: Theoretical And Empirical Work
, 1995
"... This chapter presents a review of various interpretations of the fuzzy membership function together with ways of obtaining a membership function. We emphasize that different interpretations of the membership function call for different elicitation methods. We try to make this distinction clear u ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
This chapter presents a review of various interpretations of the fuzzy membership function together with ways of obtaining a membership function. We emphasize that different interpretations of the membership function call for different elicitation methods. We try to make this distinction clear using techniques from measurement theory.
When Are Two Protocols the Same?
 Communication in MultiAgent Systems: Agent Communication Languages and Conversation Policies, Lecture Notes in Artificial Intelligence 2650
, 2002
"... A number of protocols based on the formal dialogue games of philosophy have recently been proposed for interactions between autonomous agents. Several of these proposals purport to assist agents engaged in the same types of interactions, such as persuasions and negotiations, and are superficially di ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
A number of protocols based on the formal dialogue games of philosophy have recently been proposed for interactions between autonomous agents. Several of these proposals purport to assist agents engaged in the same types of interactions, such as persuasions and negotiations, and are superficially different. How are we to determine whether or not these proposals are substantially different ? This paper considers this question and explores several alternative definitions of equivalence of protocols.