Sciweavers

1032 search results - page 9 / 207
» Extended Computation Tree Logic
Sort
View
AISC
2008
Springer
14 years 11 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan
KR
1994
Springer
15 years 1 months ago
REVISE: An Extended Logic Programming System for Revising Knowledge Bases
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued...
Carlos Viegas Damásio, Wolfgang Nejdl, Lu&i...
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
14 years 4 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
JOLLI
2008
83views more  JOLLI 2008»
14 years 9 months ago
Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propos...
Hans-Jörg Tiede
CLUSTER
2009
IEEE
15 years 4 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...