JSON Schema is an evolving standard for describing families of documents. It a logical language, based on set assertions that describe features the value under analysis and or structural combinators these assertions, including negation operator. Most languages with enjoy closure: every operator, they have negation-dual allows to be pushed through We show this not case Schema, study how changed ...

Abstract The ability to express negation in language may have been the result of an adaptive process. However, there are different accounts adaptation linguistics, and more than one them describe case negation. In this paper, I distinguish versions claim that is defend a proposal, based on recent work by Steinert-Threlkeld (2016) Incurvati Sbardolini (2021), which indirect adaptation.

Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then a (the negation by default of a) also holds. When explicit negation is used contradiction may be present (e.g. a and :a both hold for some a) and thus no semantics is given to the program. We introduce here the notion of re...

This paper looks at negation in Finnish dialects from a typological perspective. The focus is on standard negation, i.e. the negation of declarative verbal main clauses. The dialectal variation that Finnish shows in its negative construction is examined in the light of current typological knowledge of the expression of negation. Developmental trends connected to the micro-typological variation ...

In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, an...

Korean has two syntactic constructions expressing negation. Examples of the two types of negation, which I will refer to as “Short Form” and “Long Form,” are given in (2) and (3). Short Form negation involves adding a negative prefix anto the verbal complex. The Short Form negated sentence in (2) differs from the affirmative sentence in (1) only in the underlined morpheme. Long Form negation, s...

In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or “negation as failure”). The proposed mechanisms are defined by very simple modular program transformations, ...

Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong negation by means of a syntactic transformation. In this paper we pinpoint the limitations of both these approaches and argue that both types of negation sho...