#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1954

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Barbara J. Grosz, Aravind K. Joshi, +6 authors Ellen F. Prince
- 1995

This paper concerns relationships among focus of attention, choice of referring expression, and perceived coherence of utterances within a discourse segment. It presents a framework and initial theory of centering which are intended to model the local component of attentional state. The paper examines interactions between local coherence and choice of… (More)

Linguistic theories typically assign various linguistic phenomena to one of the categories, syntactic, semantic, or pragmatic, as if the phenomena in each category were relatively independent of those in the others. However, various phenomena in discourse do not seem to yield comfortably to any account that is strictly a syntactic or semantic or pragmatic… (More)

- Barbara J. Grosz, Aravind K. Joshi, Scott Weinstein
- Computational Linguistics
- 1995

This paper concerns relationships among focus of attention, choice of referring expression, and perceived coherence of utterances within a discourse segment. It presents a framework and initial theory of centering intended to model the local component of attentional state. The paper examines interactions between local coherence and choice of referring… (More)

- Daniel N. Osherson, Scott Weinstein
- Information and Control
- 1982

- Anuj Dawar, Steven Lindell, Scott Weinstein
- Inf. Comput.
- 1995

The extensions of first-order logic with a least fixed point operators (FO + LFP) and with a partial fixed point operator (FO + PFP) are known to capture the complexity classes P and PSPACE respectively in the presence of an ordering relation over finite structures. Recently, Abiteboul and Vianu [AV91b] investigated the relation of these two logics in the… (More)

- Daniel N. Osherson, Michael Stob, Scott Weinstein
- Information and Control
- 1986

Imagine that you have been appointed the director of a laboratory comprising several research teams. Each team consists of three scientists who examine data emanating from an unknown physical source. Different teams work on different problems of this nature. Each scientist elaborates a theory of the source underlying the data he receives, and he… (More)

- Aravind K. Joshi, Scott Weinstein
- IJCAI
- 1981

The purpose o f t h i s commun ica t i on i s t o exam i n e one p a r t i c u l a r a s p e c t o f d i s c o u r s e s t r u c t u r e , name l y , a d i s c o u r s e c o n s t r u c t c a l l e d c e n t e r o f a sen tence ( u t t e r a n c e ) i n d i s c o u r s e and i t s r e l a t i o n t o t he l a r g e r i s s u e o f c o n t r o l o f i n f e… (More)

- Peter Buneman, Wenfei Fan, Jérôme Siméon, Scott Weinstein
- SIGMOD Record
- 2001

Integrity constraints play a fundamental role in database design. We review initial work on the expression of integrity constraints for semistructured data and XML.

- Erich Grädel, Phokion G. Kolaitis, +5 authors Scott Weinstein
- Texts in Theoretical Computer Science. An EATCS…
- 2007

It is tempting to start by defining the subject the book is about, in this case finite model theory, in my own words. I succumb to the temptation. Finite model theory is concerned with studying, classifying, and making use of formal means for expressing properties of finite mathematical structures. This was risky. Defining a broad subarea of mathematics in… (More)

- Peter Buneman, Wenfei Fan, Scott Weinstein
- DBPL
- 1999

Path constraints have been studied in [4, 11, 12, 13] for semistructured data modeled as a rooted edge-labeled directed graph. They have proven useful in the optimization of path queries. However, in this graph model, the implication problems associated with many natural path constraints are undecidable [11, 13]. A variant of the graph model, called the… (More)