This paper develops the idea that the telicity is derived from atomicity. An atomic predicate is a singular predicate denoting a set of individuals which count as one individual on some scale of measurement, i.e. must be formally of the form λa.P(a) ∧ MEAS(a) = <1,U>. Atomic sets of this kind are derived via a maximalisation operation (Filip and Rothstein 2005, Rothstein 2007b). While in the no...

An effective SAT preprocessing technique is using symmetrybreaking predicates, i.e., auxiliary clauses that guide a solver away from needless exploration of isomorphic sub-problems. Although symmetrybreaking predicates have been in use for over a decade, it was not known how to express them in proofs of unsatisfiability. Consequently, results obtained by symmetry breaking cannot be validated by...

Time progress conditions in hybrid systems are usually speci ed in terms of invariants, predicates characterizing states where time can continuously progress or dually, deadline conditions, predicates characterizing states where time progress immediately stops. The aim of this work is the study of relationships between general time progress conditions and these generated by using state predicat...

Natural languages are typically characterized by a large area where grammar and lexicon overlap. Complex predicates with light verbs represent a typical language phenomenon at the lexicongrammar interface. Their theoretically adequate representation thus requires a close interplay between the lexicon and the grammar. In this paper, we introduce a formal model for the lexicographic description o...

EfProb is an abbreviation of Effectus Probability. It is the name of a library for probability calculations in Python. EfProb offers a uniform language for discrete, continuous and quantum probability. For each of these three cases, the basic ingredients of the language are states, predicates, and channels. Probabilities are typically calculated as validities of predicates in states. States can...

In dependency parsing of long sentences with fewer subjects than predicates, it is difficult to recognize which predicate governs which subject. To handle such syntactic ambiguity between subjects and predicates, this paper proposes an “Sclause” segmentation method, where an S(ubject)clause is defined as a group of words containing several predicates and their common subject. We propose an auto...

Let and be two sets of -monotone and non-intersecting curve segments, and . We give a new sweep-line algorithm that reports the intersecting pairs of segments of . Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above, below or on a segment. These three predicates seem to be the simpl...

We propose an algorithm for answering conjunctive queries with negation, where the negated relations are sparse. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and the submodular width. The query complexity depends on the structure of the negated subquery; in general it is exp...

The representation of the desired behaviour of a logical discrete-event system (DES), using predicates and associated sets of blocking events, is introduced. The control of a regular DES consists in blocking events when a predicate concerning the system behaviour becomes true. If a blocking event is uncontrollable an algorithm is given which transforms the associated “uncontrollable” predicates...

Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could construct a logic that includes both predicates and terms as classes in the hierarchies, it would be very useful for connecting general knowledge to specic knowledge. Although there are actually logics that are equipped...