5378 search results - page 118 / 1076 » Base Logics in Argumentation |
165
click to vote
DBPL
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
177
click to vote
LOGCOM
2000
15 years 5 months ago
2000
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
151
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
161
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...