Sciweavers

3624 search results - page 81 / 725
» Abstract Algebraic Logic
Sort
View
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 5 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
FOCS
2007
IEEE
15 years 10 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
LICS
2010
IEEE
15 years 2 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
AIML
2006
15 years 5 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
WISTP
2009
Springer
15 years 11 months ago
Algebraic Attacks on RFID Protocols
Abstract. This work aims to identify the algebraic problems which enable many attacks on RFID protocols. Toward this goal, three emerging types of attacks on RFID protocols, concer...
Ton van Deursen, Sasa Radomirovic