Sciweavers

710 search results - page 9 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
FOIKS
2006
Springer
13 years 11 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 1 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
KR
2004
Springer
14 years 1 months ago
Expressive Power and Succinctness of Propositional Languages for Preference Representation
Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...
Sylvie Coste-Marquis, Jérôme Lang, Pa...
ADC
2003
Springer
139views Database» more  ADC 2003»
14 years 26 days ago
Deriving Relation Keys from XML Keys
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much r...
Qing Wang, Hongwei Wu, Jianchang Xiao, Aoying Zhou...
WIDM
2006
ACM
14 years 1 months ago
Bridging relational database history and the web: the XML approach
The preservation of digital artifacts represents an unanswered challenge for the modern information society: XML and its query languages provide an effective environment to addre...
Fusheng Wang, Xin Zhou, Carlo Zaniolo