Negation operation is important in intelligent information processing. Different existing arithmetic negation, an exponential negation presented this paper. The new can be seen as a kind of geometry negation. Some basic properties the proposed are investigated, and we find that fix point uniform probability distribution, which reaches maximum entropy. entropy increase operation, all distributio...

This paper describes our participation in the closed track of the *SEM 2012 Shared Task of finding the scope of negation. To perform the task, we propose a system that has three components: negation cue detection, scope of negation detection, and negated event detection. In the first phase, the system creates a lexicon of negation signals from the training data and uses the lexicon to identify ...

Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, with the spre...

Research on complementizer selection has shown that the presence of a negative particle in subordinate complement clause influences choice, leading to relatively higher proportion finite complementation patterns by increasing complexity syntactic environment. Studies have also different types negation, namely not - and no -negation, increase tendency towards more explicit options (Rohdenburg 20...

This paper presents a survey on the role of negation in sentiment analysis. Negation is a very common linguistic construction that affects polarity and, therefore, needs to be taken into consideration in sentiment analysis. We will present various computational approaches modeling negation in sentiment analysis. We will, in particular, focus on aspects, such as level of representation used for ...

Constructive negation in intuitionistic logic (called strong negation [7]) can be used to directly represent negative assertions, and for which its semantics [8, 1] is defined in Kripke models by two satisfaction relations (|= P and |= N ). However, the interpretation and satisfaction based on the conventional semantics do not fit in with the definition of negation in knowledge representation w...