Name
Abstract | ||
|---|---|---|
Previous work has addressed the issues of idempotence and boundedness for various restricted classes of Horn-clause queries. In this paper, we consider queries consisting of a single clause containing a single predicate symbol. As such, these queries are a notational variant of the full, untagged tableau queries with recursive semantics. The study of the idempotence and boundedness for single-clause, single-predicate queries has previously been restricted to the typed case. We generalize these results to obtain syntactic, polynomial-time computable characterizations of idempotence for certain classes of untyped queries. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1007/3-540-50171-1_8 | ICDT |
Keywords | Field | DocType |
idempotent single-predicate horn clauses,idempotent single-predicate horn clause,various restricted class,notational variant,horn-clause query,single clause,single predicate symbol,recursive semantics,single-predicate query,certain class,previous work,polynomial-time computable characterization,polynomial time | Discrete mathematics,Horn clause,Symbol,Computer science,Predicate (grammar),Idempotence,Syntax,Recursion,Semantics | Conference |
Volume | ISSN | ISBN |
326 | 0302-9743 | 0-387-50171-1 |
Citations | PageRank | References |
9 | 7.30 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. T. Wood | 1 | 9 | 7.30 |
| alberto o mendelzon | 2 | 159 | 85.02 |
| P. Atzeni | 3 | 77 | 60.41 |