In this paper we present a dataaow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.

This paper presents a thorough study of negation in SPARQL. The types of negation supported in SPARQL are identified and their main features discussed. Then, we study the expressive power of the corresponding negation operators. At this point, we identify a core SPARQL algebra which could be used instead of the W3C SPARQL algebra. Finally, we analyze the negation operators in terms of their com...

In Sequoiah-Grayson (2009a), the author gave a basic dynamic semantics the Lambek Calculi, to which a dynamic negation was added. This dynamic negation was interpreted as procedural prohibition, or process exclusion. The resulting framework suggested connections with the analysis of negation as test–failure in the Dynamic Predicate Logic (DPL) due originally to Groenendijk and Stokhof (1991), a...

The aim of this paper is to propose a logical and algebraic theory which seems well-suited to logic programs with negatior, and deductive databases. This theory has similar properties to those of Prolog theory limited to programs with Horn clauses and tbns can be considered as sn extension of the usual theory. This parallel with logic programming without negation lies in the introduction of a t...

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

At least since Frege (1960) and Geach (1965), there has been some consensus about the relation between negation, the speech act of denial, and the attitude of rejection: a denial, the consensus has had it, is the assertion of a negation, and a rejection is a belief in a negation. Recently, though, there have been notable deviations from this orthodox view. Rejectivists have maintained that nega...

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the epistemic component of ASP, in which interpretations represent the beliefs or knowledge of a rational agent. Consequently, neither CP-logic nor FO(ID) have the ne...

We develop a denotational, fully abstract semantics for constraint logic programming (clp) with respect to successful and failed observables. The denotational approach turns out very useful for the deenition of new operators on the language as the counterpart of some abstract operations on the denotational domain. In particular, by deening our domain as a cylindric Heyting algebra, we can explo...

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.