Sciweavers

3653 search results - page 214 / 731
» On Recognizable Timed Languages
Sort
View
WWW
2009
ACM
16 years 6 months ago
C-SPARQL: SPARQL for continuous querying
C-SPARQL is an extension of SPARQL to support continuous queries over RDF data streams. Supporting streams in RDF format guarantees interoperability and opens up important applica...
Davide Francesco Barbieri, Daniele Braga, Stefano ...
139
Voted
STACS
2010
Springer
16 years 14 days ago
Inseparability and Strong Hypotheses for Disjoint NP Pairs
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
Lance Fortnow, Jack H. Lutz, Elvira Mayordomo
ENC
2008
IEEE
15 years 12 months ago
Possibilistic-Based Argumentation: An Answer Set Programming Approach
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
Juan Carlos Nieves, Ulises Cortés, Mauricio...
IPPS
2007
IEEE
15 years 11 months ago
Modeling Modern Micro-architectures using CASL
We overview CASL, the CoGenT Architecture Specification Language, a mixed behavioral-structure architecture description language designed to facilitate fast prototyping and tool ...
Edward K. Walters II, J. Eliot B. Moss, Trek S. Pa...
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
15 years 11 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton