Sciweavers

113 search results - page 9 / 23
» LTL Can Be More Succinct
Sort
View
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
14 years 11 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
CSR
2007
Springer
15 years 4 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 10 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
DMTCS
2007
73views Mathematics» more  DMTCS 2007»
14 years 10 months ago
"Trivializing" Generalizations of some Izergin-Korepin-type Determinants
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaffians due to Kuperberg, as well as a determinant of Tsuchiya. The level of ...
Tewodros Amdeberhan, Doron Zeilberger
CSFW
2008
IEEE
15 years 4 months ago
DKAL: Distributed-Knowledge Authorization Language
DKAL is a new declarative authorization language for distributed systems. It is based on existential fixed-point logic and is considerably more expressive than existing authoriza...
Yuri Gurevich, Itay Neeman