Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
632
Implication and Referential Constraints: A New Formal Reasoning
, 1994
"... In this paper, we address the issue of reasoning with two classes of commonly used semantic integrity constraints in database and knowledge-base systems: implication constraints and referential constraints. We first consider a central problem in this respect, the IRC-refuting problem, which is to de ..."
Abstract
-
Cited by 28 (1 self)
- Add to MetaCart
is to decide whether a conjunctive query always produces an empty relation on (finite) database instances satisfying a given set of implication and referential constraints. Since the general problem is undecidable, we only consider acyclic referential constraints. Under this assumption, we prove that the IRC
Discriminative probabilistic models for relational data
, 2002
"... In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, igno ..."
Abstract
-
Cited by 415 (12 self)
- Add to MetaCart
and addresses two limitations of the previous approach. First, undirected models do not impose the acyclicity constraint that hinders representation of many important relational dependencies in directed models. Second, undirected models are well suited for discriminative training, where we optimize
Translating Web Data
- In VLDB
, 2002
"... We present a novel framework for mapping between any combination of XML and relational schemas, in which a high-level, userspecified mapping is translated into semantically meaningful queries that transform source data into the target representation. Our approach works in two phases. In the first ph ..."
Abstract
-
Cited by 229 (40 self)
- Add to MetaCart
phase, the high-level mapping, expressed as a set of inter-schema correspondences, is converted into a set of mappings that capture the design choices made in the source and target schemas (including their hierarchical organization as well as their nested referential constraints).
The complexity of acyclic conjunctive queries
- Journal of the ACM
, 1998
"... This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynomial time; its precise complexity, however, has not been pinpointed so far. We show that the problem of evaluating acyc ..."
Abstract
-
Cited by 96 (21 self)
- Add to MetaCart
-complete: The Query Output Tuple problem for conjunctive queries, Conjunctive Query Containment, Clause Subsumption, and Constraint Satisfaction. The LOGCFL-completeness result is extended to the class of queries of bounded treewidth and to other relevant query classes which are more general than the acyclic queries.
The referential structure of the affective lexicon
- Cognitive Science
, 1987
"... A set of opproximotely 500 words token from the literature on emotion wos examined. The overall goal wos to develop CI comprehensive taxonomy of the affective lexicon, with special attention being devoted to the isolation of terms that refer to emotions. Within the taxonomy we propose, the best exam ..."
Abstract
-
Cited by 69 (4 self)
- Add to MetaCart
examples of emotion terms appear to be those thot (0) refer to internol, mentol conditions OS opposed to physical or external ones, (b) are clear cases of states, and (c) hove affect OS opposed to behavior or cognition OS a predominant (rather than inciden-tal) referential focus. Relaxing one or another
The developing constraints on parsing decisions: The role of lexical-biases and referential scenes in child and adult sentence processing
, 2004
"... ..."
The Use of Referential Constraints in Structuring Discourse
"... The quality of discourse structure annotations is negatively influenced by the numerous difficulties that occur in the analysis process. In contrast, referential annotation resources are considerably more reliable, given the high precision of the existent anaphora resolution systems. We present an a ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
The quality of discourse structure annotations is negatively influenced by the numerous difficulties that occur in the analysis process. In contrast, referential annotation resources are considerably more reliable, given the high precision of the existent anaphora resolution systems. We present
Syntactic ambiguity resolution in discourse: modeling the effects of referential context and lexical frequency
, 1998
"... Sentences with temporarily ambiguous reduced relative clauses (e.g., The actress selected by the director believed that...) were preceded by discourse contexts biasing a main clause or a relative clause. Eye movements in the disambiguating region (by the director) revealed that, in the relative clau ..."
Abstract
-
Cited by 99 (12 self)
- Add to MetaCart
frequency of the ambiguous verb. Reading times were modeled using a constraint-based competition framework in which multiple constraints are immediately integrated during parsing and interpretation. Simulations suggested that this framework reconciles the superficially conflicting results in the literature
Blog: Probabilistic models with unknown objects
- In IJCAI
, 2005
"... This paper introduces and illustrates BLOG, a formal language for defining probability models over worlds with unknown objects and identity uncertainty. BLOG unifies and extends several existing approaches. Subject to certain acyclicity constraints, every BLOG model specifies a unique probability di ..."
Abstract
-
Cited by 185 (10 self)
- Add to MetaCart
This paper introduces and illustrates BLOG, a formal language for defining probability models over worlds with unknown objects and identity uncertainty. BLOG unifies and extends several existing approaches. Subject to certain acyclicity constraints, every BLOG model specifies a unique probability
Acyclic Constraint Logic and Games 3 ACYCLIC CONSTRAINT LOGIC AND GAMES
"... Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is very convenient for the analysis of games, providing a uniform view.We focus on the acyclic version, apply this to Klondike,Mahjong Solitaire an ..."
Abstract
- Add to MetaCart
Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is very convenient for the analysis of games, providing a uniform view.We focus on the acyclic version, apply this to Klondike,Mahjong Solitaire
Results 1 - 10
of
632
