Sciweavers

305 search results - page 46 / 61
» Decidability of Split Equivalence
Sort
View
SAT
2009
Springer
109views Hardware» more  SAT 2009»
14 years 2 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
TLCA
2009
Springer
14 years 2 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
ICALP
2007
Springer
14 years 1 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
VTC
2006
IEEE
147views Communications» more  VTC 2006»
14 years 1 months ago
A Proportional Fair Scheduling for Multicast Services in Wireless Cellular Networks
— We propose a new multicast scheduling scheme which can achieve the proportional fair (PF) allocation in the wireless cellular systems. In case of multicast, the scheduler in th...
Chungha Koh, Young Yong Kim
LPNMR
2005
Springer
14 years 1 months ago
Some Logical Properties of Nonmonotonic Causal Theories
The formalism of nonmonotonic causal theories (Giunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonic reasoning and knowledge repr...
Marek J. Sergot, Robert Craven