778 search results - page 99 / 156 » Expressiveness and complexity of graph logic |
116
Voted
AI
2008
Springer
14 years 11 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
116
Voted
ISMVL
2000
IEEE
15 years 4 months ago
2000
IEEE
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...
153
click to vote
DLOG
2011
14 years 4 months ago
2011
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...
98
Voted
ICDE
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
111
Voted
PODS
2010
ACM
15 years 2 months ago
2010
ACM
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....