Search results for "rule-based"

Intelligent agents for feature modelling in computer aided design

2017

Abstract CAD modelling can be referred to as the process of generating an integrated multiple view model as a representation of multiple views of engineering design. In many situations, a change in the model of one view may conflict with the models of other views. In such situations, the model of some views needs to be adapted in order to make all models consistent. Thus, CAD models should be capable of adapting themselves to new situations. Recently, agent based technologies have been considered in order to increase both knowledge level and intelligence of real and virtual objects. The contribution of this paper consists in introducing the intelligent agents in intelligent CAD modelling. T…

Hand‐related action words impair action anticipation in expert table tennis players : Behavioral and neural evidence

2021

Athletes extract kinematic information to anticipate action outcomes. Here, we examined the influence of linguistic information (experiment 1, 2) and its underlying neural correlates (experiment 2) on anticipatory judgment. Table tennis experts and novices remembered a hand- or leg-related verb or a spatial location while predicting the trajectory of a ball in a video occluded at the moment of the serve. Experiment 1 showed that predictions by experts were more accurate than novices, but experts’ accuracy significantly decreased when hand-related words versus spatial locations were memorized. For nonoccluded videos with ball trajectories congruent or incongruent with server actions in exper…

Language Documentation and Descriptive Linguistics

2021

Context-free Languages

1988

In this chapter we shall define a class of rewriting systems called context-free grammars. The left-hand side of a rule in a context-free grammar consists of a single symbol, so that symbols are rewritten “context-freely”. Context-free grammars are of central importance to us because they define the class of context-free languages, the parsing of which is the subject of this book. In this chapter we shall consider some structural properties of context-free grammars which are of importance in parsing. Also, a basic method for recognizing context-free languages will be given.

Learning Molecular Classes from Small Numbers of Positive Examples Using Graph Grammars

2021

We consider the following problem: A researcher identified a small number of molecules with a certain property of interest and now wants to find further molecules sharing this property in a database. This can be described as learning molecular classes from small numbers of positive examples. In this work, we propose a method that is based on learning a graph grammar for the molecular class. We consider the type of graph grammars proposed by Althaus et al. [2], as it can be easily interpreted and allows relatively efficient queries. We identify rules that are frequently encountered in the positive examples and use these to construct a graph grammar. We then classify a molecule as being conta…

LR(k) Parsing

1990

In this chapter we shall generalize the notion of strong LL(k) parsing presented in Chapter 5 and consider a method for deterministic left parsing that applies to a slightly wider class of context-free grammars than does the strong LL(k) parsing method. This method will be called “canonical LL(k) parsing”. As in strong LL(k) parsing, the acronym “LL(k)” means that the input string is parsed (1) in a single Left-to-right scan, (2) producing a Left parse, and (3) using lookahead of length k.

Grammars++ for modelling information in text

1999

Abstract Grammars provide a convenient means to describe the set of valid instances in a text database. Flexibility in choosing a grammar can be exploited to provide information modelling capability by designing productions in the grammar to represent entities and relationships of interest to database applications. Additional constraints can be specified by attaching predicates to selected nonterminals in the grammar. When used for database definition, grammars can provide the functionality that users have come to expect of database schemas. Extended grammars can also be used to specify database manipulation, including query, update, view definition, and index specification.

A Rule-Based Multi-agent System for Local Traffic Management

2009

Road Traffic presents a high dynamism which makes necessary the development of traffic management and control strategies to improve traffic flows and more important, road safety. So it is needed the use of intelligent systems to support traffic organizations and road operators to cope with incidents. In this paper we introduce a local autonomous system for traffic management. This way, though there could be a breakdown in the communications between the local system and the TCC, the local system will be able to warn the road users in case of incidents. The system uses multiagent technology to work with the specific characteristics of traffic domain. The expert MAS system is ruled-based that …

Testing Grammars for Parsability

1990

In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…

A comparison of compatible, finite, and inductive graph properties

1993

Abstract In the theory of hyperedge-replacement grammars and languages, one encounters three types of graph properties that play an important role in proving decidability and structural results. The three types are called compatible, finite, and inductive graph properties. All three of them cover graph properties that are well-behaved with respect to certain operations on hypergraphs. In this paper, we show that the three notions are essentially equivalent. Consequently, three lines of investigation in the theory of hyperedge replacement - so far separated - merge into one.