Results 1  10
of
4,571
On Efficient Reasoning with Implication Constraints
 IN DOOD
, 1993
"... In this paper, we address the complexity issue of reasoning with implication constraints. We consider the ICRFT problem, which is the problem of deciding whether a conjunctive yes/no query always produces the empty relation ("no" answer) on database instances satisfying a given set of ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
In this paper, we address the complexity issue of reasoning with implication constraints. We consider the ICRFT problem, which is the problem of deciding whether a conjunctive yes/no query always produces the empty relation ("no" answer) on database instances satisfying a given set
Implications of rational inattention
 JOURNAL OF MONETARY ECONOMICS
, 2002
"... A constraint that actions can depend on observations only through a communication channel with finite Shannon capacity is shown to be able to play a role very similar to that of a signal extraction problem or an adjustment cost in standard control problems. The resulting theory looks enough like fa ..."
Abstract

Cited by 525 (11 self)
 Add to MetaCart
A constraint that actions can depend on observations only through a communication channel with finite Shannon capacity is shown to be able to play a role very similar to that of a signal extraction problem or an adjustment cost in standard control problems. The resulting theory looks enough like
Implicational Constraints, Defaults and Markedness *
"... Once Prince & Smolensky (1993) set the theoretical underpinnings of Optimality Theory (OT), the organization and structure of the collection of universal constraints CON soon became a topic of some debate. One of the points that has received some attention has been the possibility to extend CON ..."
Abstract
 Add to MetaCart
Once Prince & Smolensky (1993) set the theoretical underpinnings of Optimality Theory (OT), the organization and structure of the collection of universal constraints CON soon became a topic of some debate. One of the points that has received some attention has been the possibility to extend CON
Implicational Constraints, Defaults and Markedness
"... This paper is also available as GGT Report de Recerca GGT008 at http://ggt.uab.es/ ..."
Abstract
 Add to MetaCart
This paper is also available as GGT Report de Recerca GGT008 at http://ggt.uab.es/
Learnability in Optimality Theory
, 1995
"... In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given gr ..."
Abstract

Cited by 529 (35 self)
 Add to MetaCart
In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 949 (19 self)
 Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system
A framework for information systems architecture.
 IBM Syst. J.,
, 1987
"... With increasing size and complexity of the implementations of information systems, it is necessary to use some logical construct (or architecture) for defining and controlling the interfaces and the integration of all of the components of the system. This paper defines information systems architect ..."
Abstract

Cited by 546 (0 self)
 Add to MetaCart
architecture by creating a d e scriptive framework from disciplines quite independent of information systems, then by analogy specifies information systems architecture based upon the neutral, objective framework. Also, some preliminary conclusions about the implications of the resultant descriptive framework
Binary Equality Implication Constraints, Normal Forms and Data Redundancy Abstract
"... We define binary equality implication constraints (BEICs) in relational databases and study the implication problem of these constraints, in particular, we provide a sound and complete set of inference rules for a common subset of BEICs. Two normal forms with respect to BEICs are defined and shown t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We define binary equality implication constraints (BEICs) in relational databases and study the implication problem of these constraints, in particular, we provide a sound and complete set of inference rules for a common subset of BEICs. Two normal forms with respect to BEICs are defined and shown
Constraints on Shortselling and Asset Price Adjustment to Private Information
 Journal of Financial Economics
, 1987
"... This paper models effects of shortsale constraints on the speed of adjustment (to private information) of security prices. Constraints eliminate some informative trades, but do not bias prices upward. Prohibiting traders from shorting reduces the adjustment speed of prices to private information, e ..."
Abstract

Cited by 302 (3 self)
 Add to MetaCart
This paper models effects of shortsale constraints on the speed of adjustment (to private information) of security prices. Constraints eliminate some informative trades, but do not bias prices upward. Prohibiting traders from shorting reduces the adjustment speed of prices to private information
Solutions of Implication Constraints yield Type Inference for More General Algebraic Data Types
, 2005
"... We study an extension of Hindley/Milner with a userprogrammable constraint domain and a general form ofalgebraic data types which unifies common forms such as existential types, the combination of type classes and existential types and the more recent extension of guarded recursive data types. We ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
can furthermoreexpress some novel variants such as a limited form of dependent types. Type inference is reduced to solving of implication constraints. We identify sufficient conditions in terms of solutions of implication constraints underwhich inference is sound and complete. One of our main
Results 1  10
of
4,571