Constraint networks are used more and more to solve combinatorial problems in real-life applications. As pointed out in BR97], this success requires dealing with non-binary constraints, which are widely needed in real world constraint solvers. Since arc consistency is a fundamental piece of reasoning that seems to be of great help during search for solutions, it is important to have eecient arc...

Conjunctions are particularly difficult to parse in traditional, phra.se-based gramniars. This paper shows how a different representation, not b.xsed on tree structures, markedly improves the parsing problem for conjunctions. It modifies the union of phra.se marker model proposed by GoodalI [19811, where conjllnction is considered as ti le linearization of a three-dimensional union of a non-tre...

Illusory conjunctions refer to the incorrect perceptual combination of correctly perceived features, such as color and shape. Research on the phenomenon has been hampered by the lack of a measurement theory that accounts for guessing features, as well as the incorrect combination of correctly perceived features. Recently, several investigators have suggested using multinomial models as a tool f...

Abstract Prior to widespread contact with Russian, Khanty (Uralic; Finno-Ugric) did not have overt conjunctions or phrasal coordination. Instead, texts from the late 19th–early 20th centuries only include examples of conjunction-less clausal juxtaposition, which was used for both and By comparing over century, we trace emergence coordination constituents. We show that first appeared in context ...

This paper investigates a dynamic path-based method for constructing conjunctions as new attributes for decision tree learning. It searches for conditions (attribute-value pairs) from paths to form new attributes. Compared with other hypothesis-driven new attribute construction methods, the new idea of this method is that it carries out systematic search with pruning over each path of a tree to...