Sciweavers

393 search results - page 11 / 79
» Logic Programs with Classical Negation
Sort
View
LICS
1989
IEEE
13 years 11 months ago
Negation As Refutation
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
Melvin Fitting
WOLLIC
2009
Springer
14 years 2 months ago
Team Logic and Second-Order Logic
Team logic is a new logic, introduced by Väänänen [11], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing...
Juha Kontinen, Ville Nurmi
JLP
2000
104views more  JLP 2000»
13 years 7 months ago
Dynamic updates of non-monotonic knowledge bases
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...
LOGCOM
2007
72views more  LOGCOM 2007»
13 years 7 months ago
Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjo...
Rajeev Goré, Alwen Tiu
NDJFL
1998
105views more  NDJFL 1998»
13 years 7 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau