Temporal–contrastive discourse connectives (although, while, since, etc.) signal various types of relations between clauses such as temporal, contrast, concession and cause. They are often ambiguous and therefore difficult to translate from one language to another. We discuss several new and translation-oriented experiments for the disambiguation of a specific subset of discourse connectives in...

The present study is a sequel to [3] and [5]. We further explore preservational properties of a class of implicational connectives. The implicational approach to preservation examines what happens when the implicational connective is required to preserve various properties. We focus on a particular class of properties, called meta-valuational properties, and the class of implicational connectiv...

We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affine space. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [P ] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decid...

The concept of a bipolar query is studied in the framework of the flexible fuzzy querying of databases. The focus is on the aggregation of the negative and positive conditions forming a bipolar query. Three formal logical representations of such an aggregation are proposed and analyzed taking into account various possible interpretations of fuzzy logical connectives. The relation to other appro...

Accurate prediction of suitable discourse connectives (however, furthermore, etc.) is a key component of any system aimed at building coherent and fluent discourses from shorter sentences and passages. As an example, a dialog system might assemble a long and informative answer by sampling passages extracted from different documents retrieved from the web. We formulate the task of discourse conn...

The various meanings of discourse connectives like while and however are difficult to identify and annotate, even for trained human annotators. This problem is all the more important since connectives are salient textual markers of cohesion and need to be correctly interpreted for many Natural Language Processing applications. In this paper, we suggest an alternative route to reach a reliable a...

/ Introduction: Functional completeness A set of truth-functional connectives is said to be functionally complete if every truth function can be represented by some formula which uses connectives only from that set. In the first semester of a sequence of introductory symbolic logic courses, one normally remarks that the usual connectives {-, v, -•, Λ, <->} form a functionally complete set. Typi...

We present work on tagging German discourse connectives using English training data and a German-English parallel corpus, and report first results towards a more comprehensive approach of doing annotation projection for explicit discourse relations. Our results show that (i) an approach based on a dictionary of connectives currently has advantages over a simpler approach that uses word alignmen...

In this paper we deene two logics, KL n and BL n , and present tableau-based decision procedures for both. KL n is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BL n is somewhat similar; it is a temporal logic that contains con...

Possibilistic networks offer a qualitative approach for modeling epistemic uncertainty. Their practical implementation requires the specification of conditional possibility tables, as in the case of Bayesian networks for probabilities. This paper presents the possibilistic counterparts of the noisy probabilistic connectives (and, or, max, min, . . . ). Their interest is illustrated on an exampl...