The essentially Σ1 formulae of ΣL are exactly those which are provably equivalent to a disjunction of conjunctions of 2 and Σ1 formulae.

This paper deals with some dependencies between fuzzy conjunctions and fuzzy implications. More precisely, a fuzzy implication generated from a fuzzy conjunction and a fuzzy conjunction induced by a fuzzy implication is considered. In the case of a fuzzy conjunction only border conditions and monotonicity are assumed. The results are illustrated by examples of weak fuzzy connectives.

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...