Referential Nets With Attributes
نویسنده
چکیده
ODe of the essential problems in natural language production and understanding is the problem of processing referential relations. In this paper I describe a model for representing and processing referential relations: referential nets with attributes. Both processes (analyzing and generating referential expressions) are controlled by attributes. There are two types of attributes, on one hand, the ones to the internal substitutes of the objects spoken about, on the other hand, the ones to the descriptions of these objects.
منابع مشابه
How To Find The Useful Information For The Referential Integrity Problem
The solution for the referential integrity problem is mainly addressed into what the useful information is. Thus, in contrast with the usual heuristics extracted from the problem domain, the novel approach of our research is to formally model the way to explain what the useful information is. We find that (i) the fewer attributes with more truth perform better than as many as possible attribute...
متن کاملLimitations of Relationships Constructed from Coinciding Data
Partitioning of data with the group by clause is in SQL defined by one or more attributes from a single, possibly derived relation. The language therefore allows groupings defined by compositions of basic and/or referential attributes, i.e. foreign key attributes. However, partitioning applied to a view derived from more than one relation can lead to misinterpretation, ambiguity and/or incomple...
متن کاملImproving Code Generation for Associations: Enforcing Multiplicity Constraints and Ensuring Referential Integrity
UML classes involve three key elements: attributes, associations, and methods. Current object-oriented languages, like Java, do not provide a distinction between attributes and associations. Tools that generate code from associations currently provide little support for the rich semantics available to modellers such as enforcing multiplicity constraints or maintaining referential integrity. In ...
متن کاملReferential nets as ACT-R declarative memory representation
Two different predictions • Solution 1 predicts that accessing knowledge about a refO takes time. • Solution 2 finishes the comparison within a single ACT-R cycle. → ACT-R predicts behaviour according to solution 1. → Referential nets predict solution 2 (immediate access to a refO’s information). → Solution 2 is supported by inC (incremental conceptualiser, Guhe et al 2003). → Processing of con...
متن کاملGeneration of Database Transactions with Petri Nets
In this paper we show how we can generate models for the execution of database transactions. We describe a transaction goal by a data model and we give algorithms to generate Petri nets models that specify the execution of these transactions. This is done in such a way that database constraints, in particular referential integrity constraints, are preserved. So if the database is in a consisten...
متن کامل