A new numerical approach of nding out the full and reduced structural descriptions of an object (image) or class is suggested in the paper. These structural descriptions are based on the Boolean formulas obtained by a learning procedure. The conjunctions for each object at the rst level of generalization are considered as features. At the next level of generalization the relationship between co...

Heuristics based on the delete relaxation are at the forefront of modern domain-independent planning techniques. Here we introduce a principled and flexible technique for augmenting delete-relaxed tasks with a limited amount of delete information, by introducing special fluents that explicitly represent conjunctions of fluents in the original planning task. Differently from previous work in thi...

Comprehensively searching for words in Sanskrit E-text is a non-trivial problem because words could change their forms in different contexts. One such context is sandhi or euphonic conjunctions, which cause a word to change owing to the presence of adjacent letters or words. The change wrought by these possible conjunctions can be so significant in Sanskrit that a simple search for the word in ...

MF-$0.65 HC-$3.29 *Form Classes (Languages) ; *Nominals; *Paired Associate Learning; *Recall (Psychological); Sentence structure; Structural Analysis; *Structural Grammar Second and sixth graders were asked to learn noun pairs linked by various types of verbal connectives: Verbs, unmarked and marked comparative adjectives, polar antonym adjective pairs, and Conjunctions. Results indicated that ...

We consider the problem of supporting sublinear space programming in a functional programming language. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot compose functions directly for lack of space for the intermediate result, but must instead compute and recompute small parts of the intermediate re...

We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorithm, achieving set-domain consistency, for open global cardinality constraints. We extend this result to conjunctions of them, in case they are defined on disjoint sets of variables. We also analyze the case when the se...