We present an eecient algorithm to detect if the conjunction of two nonlocal predicates is possibly true in a distributed computation. For ooine detection of such global predicates, our algorithm is signiicantly more eecient than the previous algorithms

The recognition of named entities is now a welldeveloped area, with a range of symbolic and machine learning techniques that deliver high accuracy identification and categorisation of a variety of entity types. However, there are still some named entity phenomena that present problems for existing techniques; in particular, relatively little work has explored the disambiguation of conjunctions ...

Named entity recognition consists of identifying ‘mentions’ — strings in a text that correspond to named entities — and then classifying each such mention as corresponding to a specific type of named entity, with typical categories being Company, Person and Location. The full range of named entity categories to be identified is usually application dependent. Introduced for the first time as a s...

In this paper we present a functional representation of human expert reasoning throughout its statements when assessing the condition of a given object. The human expert statements are represented as conjunctions of elementary propositions. We demonstrate that the conjunctions of elementary propositions can be represented as qualitative additions of qualitative functions in the Q-algebra (Q, ≈,...

We show that adding role conjunctions to the Description Logics (DLs) SHI and SHOIF causes a jump in the computational complexity of the standard reasoning tasks from ExpTime-complete to 2ExpTime-complete and from NExpTime-complete to N2ExpTime-hard respectively. We further show that this increase is due to a subtle interaction between inverse roles, role hierarchies, and role transitivity in t...

We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value bipartite graph. Therefore, we investigate the problem of finding simultaneous bipartite matchings. We present an extension of the famous Hall theorem which characterizes when simultaneous bipartite matchings exists. ...

This paper discusses verb-first conditionals (Had I known this, I would have stayed at home) with regard to the hypothesis that the construction developed from a dialogual sequence into a hypotactic structure. While plausible, independent evidence for this scenario has been scarce. An alternative account posits that questions could have been analogized with existing conditional clause types, ma...