Results 1 - 10 of 597

Inclusion Constraints over Non-empty Sets of Trees

by Martin Müller, Joachim Niehren, Andreas Podelski , 1997
"... We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 `t2 between first-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express INES constraints only if they include ne ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 `t2 between first-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express INES constraints only if they include

English Relative Clause Constructions

by Ivan A. Sag - JOURNAL OF LINGUISTICS , 1997
"... This paper sketches a grammar of English relative clause constructions (including infinitival and reduced relatives) based on the notions of construction type and type constraints. Generalizations about dependency relations and clausal functions are factored into distinct dimensions contributing con ..."
Abstract - Cited by 191 (14 self) - Add to MetaCart
constraints to specific construction types in a multiple inheritance type hierarchy. The grammar presented here provides an account of extraction, pied piping and relative clause `stacking' without appeal to transformational operations, transderivational competition, or invisible (`empty

The emptiness problem for tree automata with global constraints

by Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Inria Saclay, Camille Vacher, France Telecom R&d - in: 25th Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer , 2010
"... Abstract—We define tree automata with global constraints (TAGC), generalizing the class of tree automata with global equality and disequality constraints [1] (TAGED). TAGC can test for equality and disequality between subterms whose positions are defined by the states reached during a computation. I ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
. In particular, TAGC can check that all the subterms reaching a given state are distinct. This constraint is related to monadic key constraints for XML documents, meaning that every two distinct positions of a given type have different values. We prove decidability of the emptiness problem for TAGC. This solves

Case Constraints and Empty Categories in Optimality Theory Parsing

by Ron Artstein - the Conference on Architectures and Mechanisms in Language Processing (AMLaP , 2000
"... Double object questions are harder to process than the corresponding questions with prepositional objects (Boland 1997). When given the choice between the two, a parser prefers to wait and not associate a filler with a gap in a double object construction, contrary to the prediction of the Active ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
not from the cost of holding the filler in memory). The results are formulated in an extension to Stevenson and Smolensky's (1997) Optimality Theory parser, as tension between constraints that mark Case and argument structure. 1 Introduction This paper extends the work of Stevenson and Smolensky

Case Constraints and Empty Categories in Optimality Theory Parsing

by Ron Artstein April - the Conference on Architectures and Mechanisms in Language Processing (AMLaP , 2000
"... Double object questions are harder to process than the corresponding questions with prepositional objects (Boland 1997). When given the choice between the two, a parser prefers to wait and not associate a filler with a gap in a double object construction, contrary to the prediction of the Active ..."
Abstract - Add to MetaCart
not from the cost of holding the filler in memory). The results are formulated in an extension to Stevenson and Smolensky's (1997) Optimality Theory parser, as tension between constraints that mark Case and argument structure. 1 Introduction This paper extends the work of Stevenson and Smolensky

The emptiness problem for tree automata . . .

by Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
"... We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can test for equality and disequality between sub-terms whose positions are defined by the states reached during a computatio ..."
Abstract - Add to MetaCart
computation. In particular, TAGC can check that all the subterms reaching a given state are distinct. This constraint is related to monadic key constraints for XML documents, meaning that every two distinct positions of a given type have different values. We prove decidability of the emptiness problem

Recovering Empty Arguments in Korean

by H. S. Park, D. Egedi, M. Palmer
"... This paper looks at empty arguments in Korean, and the constraints that can be used in recovering their meaning, or referent. We look at scrambling to provide insights into the process by which empty arguments can be recovered, and provide a computational algorithm based on local and global informat ..."
Abstract - Add to MetaCart
This paper looks at empty arguments in Korean, and the constraints that can be used in recovering their meaning, or referent. We look at scrambling to provide insights into the process by which empty arguments can be recovered, and provide a computational algorithm based on local and global

Materialized view maintenance and integrity constraint checking: Trading space for time

by Kenneth A. Ross, Divesh Srivastava , 1996
"... Abstract We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenance by materializing (and maintaining) additional views. We formulate the problem of determining the optimal set o ..."
Abstract - Cited by 115 (7 self) - Add to MetaCart
of additional views to materialize as an optimization problem over the space of possible view sets (which includes the empty set). The optimization problem is harder than query optimization since it has to deal with multiple view sets, updates of multiple relations, and multiple ways of maintaining each view

Continuous Filling and Emptying of Storage Systems in Constraint-Based Scheduling

by Francis Sourd, Jérôme Rogerie , 2002
"... In constraint-based scheduling, storage systems are modelled by a class of resource called reservoir. Activities can either produce or consume a capacity in a reservoir. ..."
Abstract - Add to MetaCart
In constraint-based scheduling, storage systems are modelled by a class of resource called reservoir. Activities can either produce or consume a capacity in a reservoir.

Emptiness of multi-pushdown automata is 2ETIME-complete

by Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
"... Abstract. We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-empty stack (which implies that we assume a linear ordering on the collection of stacks). We show that the emptin ..."
Abstract - Cited by 31 (10 self) - Add to MetaCart
Abstract. We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-empty stack (which implies that we assume a linear ordering on the collection of stacks). We show
Results 1 - 10 of 597