2303 search results - page 408 / 461 » On the logic of argumentation theory |
166
click to vote
KBSE
2009
IEEE
16 years 27 days ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
176
click to vote
LICS
2009
IEEE
16 years 25 days ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
173
click to vote
ATAL
2009
Springer
16 years 23 days ago
2009
Springer
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
143
click to vote
FMCAD
2009
Springer
16 years 22 days ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
164
click to vote
TLCA
2009
Springer
16 years 21 days ago
2009
Springer
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...