This essay proposes a procedural interpretation of negative information in terms of split negation as procedural prohibition. Information frames and models are introduced, with negation defined as the implication of bottom, 0. A method for extracting the procedures prohibited by complex formulas is outlined, and the relationship between types of prohibited procedures is identified. Definitions ...

We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with negation under the stable model semantics. We consider both possible and certain answers and both closedand open-world interpretation of C-databases with and without conditions. By reduction to stable models of logic programs we...

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-neg...

BACKGROUND The treatment of negation and hedging in natural language processing has received much interest recently, especially in the biomedical domain. However, open access corpora annotated for negation and/or speculation are hardly available for training and testing applications, and even if they are, they sometimes follow different design principles. In this paper, the annotation principle...

I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, ...

Prior’s arguments for and against seeing ‘ought’ as a copula and his considerations about normative negation are applied to the case of responsibility judgments. My thesis will be that responsibility judgments, even though often expressed by using the verb ‘to be’, are in fact normative judgments. This is shown by analyzing their negation, which parallels the behavior of ought negation.

This paper presents an open-source toolkit for negation detection. It identifies negation cues and their corresponding scope in either raw or parsed text using maximummargin classification. The system design draws on best practice from the existing literature on negation detection, aiming for a simple and portable system that still achieves competitive performance. Pretrained models and experim...

Concord describes a natural language phenomenon in which single logical meaning is expressed syntactically on multiple lexical items. The canonical example negative concord, expressions are used, but negation interpreted. Formally similar phenomena have been observed for the redundant marking of distributivity and definiteness. Inspired by recent dynamic analyses these latter two phenomena, we ...

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the μcalculus, as well as conjunctive queries and monadic Datalog. We show that satisfiability and finite satisfiability are decidable for both fragments, a...

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...