Sciweavers

135 search results - page 6 / 27
» Constructive Logic with Strong Negation as a Substructural L...
Sort
View
ICLP
2001
Springer
15 years 2 months ago
An Order-Sorted Resolution with Implicitly Negative Sorts
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...
Ken Kaneiwa, Satoshi Tojo
69
Voted
SOCO
2008
Springer
14 years 9 months ago
Strong non-standard completeness for fuzzy logics
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
Tommaso Flaminio
71
Voted
AAAI
2000
14 years 11 months ago
A Flexible Framework for Defeasible Logics
Logics for knowledge representation suffer from overspecialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for o...
Grigoris Antoniou, David Billington, Guido Governa...
EPIA
1995
Springer
15 years 1 months ago
A Model Theory for Paraconsistent Logic Programming
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
Carlos Viegas Damásio, Luís Moniz Pe...
IGPL
2011
14 years 29 days ago
Interpolation and FEP for logics of residuated algebras
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
Wojciech Buszkowski