Sciweavers

265 search results - page 43 / 53
» Logical Queries over Views: Decidability and Expressiveness
Sort
View
POPL
1997
ACM
15 years 2 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
PERCOM
2009
ACM
15 years 10 months ago
Programmable Presence Virtualization for Next-Generation Context-Based Applications
Abstract--Presence, broadly defined as an event publishnotification infrastructure for converged applications, has emerged as a key mechanism for collecting and disseminating conte...
Arup Acharya, Nilanjan Banerjee, Dipanjan Chakrabo...
SCP
2010
96views more  SCP 2010»
14 years 8 months ago
Enforcing structural regularities in software using IntensiVE
The design and implementation of a software system is often governed by a variety of coding conventions, design patterns, architectural guidelines, design rules, and other so-call...
Johan Brichau, Andy Kellens, Sergio Castro, Theo D...
EDBTW
2006
Springer
15 years 1 months ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
90
Voted
ICLP
1997
Springer
15 years 2 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...