Sciweavers

2501 search results - page 5 / 501
» Logics with Rank Operators
Sort
View
LICS
2006
IEEE
14 years 1 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
CSL
2008
Springer
13 years 9 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 7 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
Nick Bezhanishvili, Balder ten Cate
USENIX
2007
13 years 9 months ago
Wresting Control from BGP: Scalable Fine-Grained Route Control
Today’s Internet users and applications are placing increased demands on Internet service providers (ISPs) to deliver fine-grained, flexible route control. To assist network o...
Patrick Verkaik, Dan Pei, Tom Scholl, Aman Shaikh,...