Sciweavers

1458 search results - page 108 / 292
» Extended Term Rewriting Systems
Sort
View
ICNS
2007
IEEE
15 years 4 months ago
A Wireless Mesh Network-based System for Hotspots Deployment and Management
— In recent years Wireless Local Area Networks (WLANs) or hotspots, as they are commonly known, have emerged as a promising networking platform to extend network connectivity in ...
Jorge Hortelano, Juan-Carlos Cano, Carlos Miguel T...
CSL
2002
Springer
14 years 9 months ago
Classical Linear Logic of Implications
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
Masahito Hasegawa
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
15 years 10 months ago
Querying xml with update syntax
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...
Wenfei Fan, Gao Cong, Philip Bohannon
LACL
2005
Springer
15 years 3 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
JSYML
2007
85views more  JSYML 2007»
14 years 9 months ago
Lower bounds for modal logics
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
Pavel Hrubes