Sciweavers

2409 search results - page 38 / 482
» On Extended Regular Expressions
Sort
View
DEBS
2008
ACM
14 years 11 months ago
Extending Siena to support more expressive and flexible subscriptions
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
John Keeney, Dominik Roblek, Dominic Jones, David ...
ICWS
2008
IEEE
14 years 11 months ago
Extending WS-Notification with an Expressive Event Notification Broker
Web service applications integrate explicit client-service interactions with notification-style programming. Such event-driven interactions are often called implicit invocations b...
Sven De Labey, Eric Steegmans
ICFP
1999
ACM
15 years 2 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
RULEML
2004
Springer
15 years 3 months ago
Extending SWRL to Express Fully-Quantified Constraints
Craig McKenzie, Peter M. D. Gray, Alun D. Preece
ENTCS
2008
87views more  ENTCS 2008»
14 years 9 months ago
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...
Lunjin Lu