Sciweavers

522 search results - page 69 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 3 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
DLOG
2011
13 years 2 months ago
Query Answering over SROIQ Knowledge Bases with SPARQL
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
Ilianna Kollia, Birte Glimm, Ian Horrocks
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 5 months ago
Stream Variables: A Quick but not Dirty SQL Extension for Continuous Queries
The ability to query data streams is of increasing importance and has been identified as a crucial element for modern organizations and agencies. This paper identifies a class o...
Damianos Chatziantoniou, Yannis Sotiropoulos
CIE
2009
Springer
14 years 2 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
PODS
2010
ACM
159views Database» more  PODS 2010»
14 years 19 days ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo