JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Afrati, F | en |
| dc.contributor.author | Andronikos, T | en |
| dc.contributor.author | Kavalieros, T | en |
| dc.date.accessioned | 2014-03-01T02:48:18Z | |
| dc.date.available | 2014-03-01T02:48:18Z | |
| dc.date.issued | 1995 | en |
| dc.identifier.uri | https://dspace.lib.ntua.gr/xmlui/handle/123456789/33720 | |
| dc.subject | Expressive Power | en |
| dc.subject | Inequality Constraint | en |
| dc.subject | Linear Constraint | en |
| dc.subject | Query Language | en |
| dc.subject | First Order | en |
| dc.subject | First Order Logic | en |
| dc.subject | Higher Order Logic | en |
| dc.title | On the Expressiveness of First-Order Constraint Languages | en |
| heal.type | conferenceItem | en |
| heal.identifier.primary | 10.1007/3-540-60794-3_12 | en |
| heal.identifier.secondary | http://dx.doi.org/10.1007/3-540-60794-3_12 | en |
| heal.publicationDate | 1995 | en |
| heal.abstract | . We investigate the expressive power of query languages forconstraint databases. We examine languages over first order logic enhancedwith the inequality constraint and linear constraints. We showthat the query "one-line" is not expressible in FO+order (i.e. inequalityconstraint). In fact, the result is stronger in that we prove that it is notexpressible in any higher order logic either. Furthermore, we show | en |
| heal.journalName | Constraint Databases and Applications | en |
| dc.identifier.doi | 10.1007/3-540-60794-3_12 | en |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
