Sciweavers

3053 search results - page 73 / 611
» A Logic of Abstract Argumentation
Sort
View
COMMA
2008
15 years 7 months ago
Basic influence diagrams and the liberal stable semantics
Abstract. This paper is concerned with the general problem of constructing decision tables and more specifically, with the identification of all possible outcomes of decisions. We ...
Paul-Amaury Matt, Francesca Toni
LICS
2010
IEEE
15 years 4 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
DATE
2002
IEEE
83views Hardware» more  DATE 2002»
15 years 11 months ago
Reconfigurable SoC - What Will it Look Like?
The argument against ASIC SoCs is that they have always taken too long and cost too much to design. As new process technologies come on line, the issue of inflexible, unyielding d...
J. Bryan Lewis, Ivo Bolsens, Rudy Lauwereins, Chri...
AIML
2006
15 years 7 months ago
ML is not finitely axiomatizable over Cheq
abstract. We show that the Medvedev logic ML is not finitely axiomatizable over the logic Cheq of chequered subsets of R. This gives a negative solution to one of the questions rai...
Gaëlle Fontaine
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
15 years 8 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders