Global constraint design is a key success of CP for solving hard combinatorial problems. Many works suggest that automaton-based definitions and filtering make easier the design of new global constraints. In this paper, from such a design, we present an approach that gives an automaton-based definition of the NEGATION of a global constraint... for free! For a given global constraint C, the idea...

I have been studying the following work on description logic, which is closely related to my main work on extensions of order-sorted logic and logic programming [4, 3, 2]. Title: Negation in Description Logics: Contraries, Contradictories and Subcontraries (under submission) Abstract: We propose an alternative description logic ALC∼ with classical negation and strong negation. In particular, we...

The problems of the meaning and function of negation are disentangled from ontological issues with which they have been long entangled. TIle question of the function of negation is the crucial issue separating relevant and paraconsistent logics from classical theories. The function is illuminated by considering the inferential role of contradictions, contradiction being parasitic on negation. T...

We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we a representation so called square root negation within this as operation which acts like cycling negation. define two variants logical matrices performing different orders over the set truth values. Purely formal result our study consists in ...

The aim of this paper is to propose f-structure representations of two different types of negation: constituent negation and eventuality negation. In particular, the paper substantiates a suggestion recently made within the PARGRAM community that two binary-valued attributes are needed. We also show that, while the distinction between constituent and eventuality negation is often treated as epi...

This paper introduces a logic ILED derived from standard intuitionistic sentence logic by adding two operators Dϕ for " Definitely ϕ " and ~ϕ for " Experience rejects ϕ ". A further negation ¬ϕ = def (ϕ→⊥) ∨ ~ϕ , which we call real negation, is introduced. Real negation is like intuitionistic negation when there are no D-operators but deviates when there are. We see that Dϕ ↔ ϕ is valid but ¬Dϕ...