778 search results - page 61 / 156 » Expressiveness and complexity of graph logic |
128
click to vote
SIGMOD
2000
ACM
15 years 4 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
102
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
209
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
101
click to vote
VL
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
119
click to vote
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...