The quest ion of whether concepts expressible as d is junc t ions of conjunct ions can be learned from examples in polynomial t ime is i nves t i ga ted . Pos i t i ve resu l t s are shown fo r s i g n i f i c a n t sub­ classes tha t a l low not only p ropos i t i ona l p re ­ d icates but also some r e l a t i o n s . The algori thms are extended so as to be provably t o l e ran t to a ce r t...

The processing of color and form is largely segregated within the visual brain. But there is also evidence to suggest that these features are coded in combination early in visual processing. Here, we combined high-resolution functional magnetic resonance imaging (fMRI) together with multivariate pattern classification to examine where in the visual cortex specific color form "conjunctions" are ...

Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval [0,1]. Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program gene...

Traditional approaches to semantics give a logical, settheoretic account of category conjunction, where an item is a member of a conjunction A&B only if it is a member of both single categories A and B. However, people do not always follow this logical approach when classifying items in conjunctions. For example, Hampton (1988) found that people typically classify blackboards as non-members of ...

INTRODUCTION This study was conducted to assess the nutritional status in Iranian major depres¬sive disorder patients. We also determined the relationship between nutrients intake with depres¬sion severity. METHODS Seventy major depressive patients were selected randomly from outpatient depressive subjects, referred to Razi Psychiatry Hospital in Tabriz, Iran in 2007. Dietary intakes were rec...

Complex conjunctions and determiners are often considered as pretokenized units in parsing. This is not always realistic, since they can be ambiguous. We propose a model for joint dependency parsing and multiword expressions identification, in which complex function words are represented as individual tokens linked with morphological dependencies. Our graphbased parser includes standard secondo...

We study online learning in Boolean domains using kernels which capture feature expansions equivalent to using conjunctions over basic features. We demonstrate a tradeoff between the computational efficiency with which these kernels can be computed and the generalization ability of the resulting classifier. We first describe several kernel functions which capture either limited forms of conjunc...

The design of neural networks that are able to efficiently detect conjunctions of features is an important open challenge. We develop a feed-forward spiking neural network that requires a constant number of neurons for detecting a conjunction irrespective of the size of the retinal input field, and for up to four simultaneously present feature-conjunctions.