Ordering and path constraints over semistructured data

Elisa Bertino, Ahmed Elmagarmid, Mohand Saïd Hacid

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Constraints are a valuable tool for managing information. Feature constraints have been used for describing records in constraint programming (Aït-Kaci and Podelski, 1993; Smolka and Treinen, 1994) and record like structures in computational linguistics (Kaplan and Bresnan, 1982; Shieber, 1986). In this paper, we consider how constraint-based technology can be used to query and reason about semistructured data. The constraint system FT ≤ (Müller et al., 1997) provides information ordering constraints interpreted over feature trees. Here, we show how a generalization of FT ≤ combined with path constraints can be used to formally represent, state constraints, and reason about semistructured data. The constraint languages we propose provide possibilities to straightforwardly capture, for example, what it means for a tree to be a subtree or subsumed by another, or what it means for two paths to be divergent. We establish a logical semantics for our constraints thanks to axiom schemes presenting our first-order theory constraint system. We propose using the constraint systems for querying semistructured data.

Original languageEnglish
Pages (from-to)181-206
Number of pages26
JournalJournal of Intelligent Information Systems
Volume20
Issue number2
DOIs
Publication statusPublished - 1 Mar 2003
Externally publishedYes

Fingerprint

Constraint theory
Computational linguistics
Semantics

Keywords

  • Constraints
  • Rule languages
  • Satisfiability
  • Semistructured data

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Ordering and path constraints over semistructured data. / Bertino, Elisa; Elmagarmid, Ahmed; Hacid, Mohand Saïd.

In: Journal of Intelligent Information Systems, Vol. 20, No. 2, 01.03.2003, p. 181-206.

Research output: Contribution to journalArticle

Bertino, Elisa ; Elmagarmid, Ahmed ; Hacid, Mohand Saïd. / Ordering and path constraints over semistructured data. In: Journal of Intelligent Information Systems. 2003 ; Vol. 20, No. 2. pp. 181-206.
@article{2398e76ba38b4e7eb2a9aa82607c8fb7,
title = "Ordering and path constraints over semistructured data",
abstract = "Constraints are a valuable tool for managing information. Feature constraints have been used for describing records in constraint programming (A{\"i}t-Kaci and Podelski, 1993; Smolka and Treinen, 1994) and record like structures in computational linguistics (Kaplan and Bresnan, 1982; Shieber, 1986). In this paper, we consider how constraint-based technology can be used to query and reason about semistructured data. The constraint system FT ≤ (M{\"u}ller et al., 1997) provides information ordering constraints interpreted over feature trees. Here, we show how a generalization of FT ≤ combined with path constraints can be used to formally represent, state constraints, and reason about semistructured data. The constraint languages we propose provide possibilities to straightforwardly capture, for example, what it means for a tree to be a subtree or subsumed by another, or what it means for two paths to be divergent. We establish a logical semantics for our constraints thanks to axiom schemes presenting our first-order theory constraint system. We propose using the constraint systems for querying semistructured data.",
keywords = "Constraints, Rule languages, Satisfiability, Semistructured data",
author = "Elisa Bertino and Ahmed Elmagarmid and Hacid, {Mohand Sa{\"i}d}",
year = "2003",
month = "3",
day = "1",
doi = "10.1023/A:1021880119937",
language = "English",
volume = "20",
pages = "181--206",
journal = "Journal of Intelligent Information Systems",
issn = "0925-9902",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Ordering and path constraints over semistructured data

AU - Bertino, Elisa

AU - Elmagarmid, Ahmed

AU - Hacid, Mohand Saïd

PY - 2003/3/1

Y1 - 2003/3/1

N2 - Constraints are a valuable tool for managing information. Feature constraints have been used for describing records in constraint programming (Aït-Kaci and Podelski, 1993; Smolka and Treinen, 1994) and record like structures in computational linguistics (Kaplan and Bresnan, 1982; Shieber, 1986). In this paper, we consider how constraint-based technology can be used to query and reason about semistructured data. The constraint system FT ≤ (Müller et al., 1997) provides information ordering constraints interpreted over feature trees. Here, we show how a generalization of FT ≤ combined with path constraints can be used to formally represent, state constraints, and reason about semistructured data. The constraint languages we propose provide possibilities to straightforwardly capture, for example, what it means for a tree to be a subtree or subsumed by another, or what it means for two paths to be divergent. We establish a logical semantics for our constraints thanks to axiom schemes presenting our first-order theory constraint system. We propose using the constraint systems for querying semistructured data.

AB - Constraints are a valuable tool for managing information. Feature constraints have been used for describing records in constraint programming (Aït-Kaci and Podelski, 1993; Smolka and Treinen, 1994) and record like structures in computational linguistics (Kaplan and Bresnan, 1982; Shieber, 1986). In this paper, we consider how constraint-based technology can be used to query and reason about semistructured data. The constraint system FT ≤ (Müller et al., 1997) provides information ordering constraints interpreted over feature trees. Here, we show how a generalization of FT ≤ combined with path constraints can be used to formally represent, state constraints, and reason about semistructured data. The constraint languages we propose provide possibilities to straightforwardly capture, for example, what it means for a tree to be a subtree or subsumed by another, or what it means for two paths to be divergent. We establish a logical semantics for our constraints thanks to axiom schemes presenting our first-order theory constraint system. We propose using the constraint systems for querying semistructured data.

KW - Constraints

KW - Rule languages

KW - Satisfiability

KW - Semistructured data

UR - http://www.scopus.com/inward/record.url?scp=0037366753&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037366753&partnerID=8YFLogxK

U2 - 10.1023/A:1021880119937

DO - 10.1023/A:1021880119937

M3 - Article

VL - 20

SP - 181

EP - 206

JO - Journal of Intelligent Information Systems

JF - Journal of Intelligent Information Systems

SN - 0925-9902

IS - 2

ER -