Sciweavers

265 search results - page 4 / 53
» Weakly Algebraizable Logics
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
EUSFLAT
2009
118views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
Fuzzy Implications and the Weak Law of Importation
Some open problems on fuzzy implications dealing with the so-called importation law are studied and totally or partially solved in this work. In particular, it is proved that such ...
Sebastià Massanet, Joan Torrens
APAL
2010
123views more  APAL 2010»
13 years 8 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
EUROSYS
2010
ACM
14 years 1 months ago
Policy-based access control for weakly consistent replication
Combining access control with weakly consistent replication presents a challenge if the resulting system is to support eventual consistency. If authorization policy can be tempora...
Ted Wobber, Thomas L. Rodeheffer, Douglas B. Terry
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
14 years 3 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser