While ∧,∨,¬ form a complete set of connectives for classical propositional logic, this does not hold for Łukasiewicz’s three-valued propositional logic, nor its generalization to n-valued logic. We define a unary connective r so that ∧,∨,¬, r form a complete set of connectives for n-valued Łukasiewicz logic. We discuss generalizations of this to infinitary logics. If we allow infinite conjuncti...

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

In English text, independent clauses should be demarcated with full-stops (periods), or linked together with conjunctions. Non-native speakers are often prone to linking them improperly with commas instead of conjunctions, producing comma splices. This paper describes a method to detect comma splices using Conditional Random Fields (CRF), with features derived from parse tree patterns. In exper...

We present average case models of algorithms for learning Conjunctive Normal Form (CNF, i.e., conjunctions of disjunctions) and Disjunctive Normal Form (DNF, i.e., disjunctions of conjunctions). Our goal is to predict the expected error of the learning algorithm as a function of the number n of training examples, averaging over all sequences of n training examples. We show that our average case...

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

Visual processing of objects in the absence of focused attention appears to be limited. We varied the degree of attention, or visual processing, that observers paid to objects using an instruction set manipulation. In 2 experiments, subjects performed tasks that required superficial or detailed visual analysis of the objects involved. In subsequent recognition tests, information about conjuncti...

In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input domain. We consider distribution-free testing of several basic Boolean function classes over {0, 1}, namely monotone conjunctions, general conjunctions, decision lists, and linear threshold functions. We prove that for eac...

A generalization of the minimal hitting-set algorithm given by deKleer and Williams is presented. The original algorithm handles only one faulty mode per component and only positive conflicts. In contrast, the new algorithm presented here handles more than two modes per component and also non-positive conflicts. The algorithm computes a logical formula that characterizes all diagnoses. Instead ...

Determining the correct structure of coordinating conjunctions and the syntactic constituents that they coordinate is a difficult task. This subtask of syntactic parsing is explored here for biomedical scientific literature. In particular, the intuition that sentences containing coordinating conjunctions can often be rephrased as two or more smaller sentences derived from the coordination struc...

It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas. We show that this asymmetry between syntax and semantics persists also when infinite conjunctions (up to some...