63 search results - page 10 / 13 » Distance-based paraconsistent logics |
110
Voted
SLOGICA
2010
15 years 17 days ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
148
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
106
Voted
COMMA
2006
15 years 3 months ago
2006
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
116
Voted
JELIA
2010
Springer
15 years 19 days ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
119
Voted
PODS
2010
ACM
15 years 2 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...