Results 1 - 10 of 37,921

An Active Rule Language for ROCK & ROLL

by Andrew Dinn, Norman W. Paton, M. Howard Williams, Alvaro A. A. Fernandes - IN PROC. 14TH BRITISH NATIONAL CONFERENCE ON DATABASES , 1996
"... This paper presents an active rule language for the ROCK ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
This paper presents an active rule language for the ROCK

Visual Active Rule Language

by Mihhail Matskin, Danilo Montesi , 1996
"... This paper introduces a visual language for active database systems. We present a new approach to database programming based on visual active language that allows us to describe active rules in a graphical way. The resulting visual language can be transformed into a textual one. In addition, an acti ..."
Abstract - Add to MetaCart
This paper introduces a visual language for active database systems. We present a new approach to database programming based on visual active language that allows us to describe active rules in a graphical way. The resulting visual language can be transformed into a textual one. In addition

A Framework for the Specification of Active Rule Language Semantics

by Paolo Atzeni, Val Tannen (eds, Danilo Montesi, Riccardo Torlone, Danilo Montesi, Riccardo Torlone
"... ©Copyright in this paper belongs to the author(s) Published in collaboration with the ..."
Abstract - Add to MetaCart
©Copyright in this paper belongs to the author(s) Published in collaboration with the

The Ponder Policy Specification Language

by Nicodemos Damianou , Naranker Dulay , Emil Lupu , Morris Sloman - LECTURE NOTES IN COMPUTER SCIENCE , 2001
"... The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databases and Java. It supports obligation policies that are event triggered conditionaction rules for policy based management ..."
Abstract - Cited by 499 (28 self) - Add to MetaCart
The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databases and Java. It supports obligation policies that are event triggered conditionaction rules for policy based management

A Simple Rule-Based Part of Speech Tagger

by Eric Brill , 1992
"... Automatic part of speech tagging is an area of natural language processing where statistical techniques have been more successful than rule- based methods. In this paper, we present a sim- ple rule-based part of speech tagger which automatically acquires its rules and tags with accuracy coinparable ..."
Abstract - Cited by 596 (9 self) - Add to MetaCart
Automatic part of speech tagging is an area of natural language processing where statistical techniques have been more successful than rule- based methods. In this paper, we present a sim- ple rule-based part of speech tagger which automatically acquires its rules and tags with accuracy coinparable

Semantics of Context-Free Languages

by Donald E. Knuth - In Mathematical Systems Theory , 1968
"... "Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract - Cited by 569 (0 self) - Add to MetaCart
. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal

Sampling Large Databases for Association Rules

by Hannu Toivonen , 1996
"... Discovery of association rules is an important database mining problem. Current algorithms for nding association rules require several passes over the analyzed database, and obviously the role of I/O overhead is very signi cant for very large databases. We present new algorithms that reduce the data ..."
Abstract - Cited by 470 (3 self) - Add to MetaCart
the database activity considerably. Theidea is to pick a random sample, to ndusingthis sample all association rules that probably hold in the whole database, and then to verify the results with the restofthe database. The algorithms thus produce exact association rules, not approximations based on a sample

Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging

by Eric Brill - Computational Linguistics , 1995
"... this paper, we will describe a simple rule-based approach to automated learning of linguistic knowledge. This approach has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance. We present a detailed case study of this learni ..."
Abstract - Cited by 924 (8 self) - Add to MetaCart
this paper, we will describe a simple rule-based approach to automated learning of linguistic knowledge. This approach has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance. We present a detailed case study

Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language

by Philip Resnik , 1999
"... This article presents a measure of semantic similarityinanis-a taxonomy based on the notion of shared information content. Experimental evaluation against a benchmark set of human similarity judgments demonstrates that the measure performs better than the traditional edge-counting approach. The a ..."
Abstract - Cited by 609 (9 self) - Add to MetaCart
in arti#cial intelligence and psychology, dating back to the spreading activation approach of Quillian #1968# and Collins and Loftus #1975#. Semantic similarity represents a special case of semantic relatedness: for example, cars and gasoline would seem to be more closely related than, say, cars

Theory and Practice of Constraint Handling Rules

by Thom Frühwirth , 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of mu ..."
Abstract - Cited by 455 (37 self) - Add to MetaCart
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting
Results 1 - 10 of 37,921