Sciweavers

796 search results - page 96 / 160
» A Formalization of ODMG Queries
Sort
View
101
Voted
XIMEP
2005
ACM
90views Database» more  XIMEP 2005»
15 years 6 months ago
XPath 2.0: It Can Sort!
As XML finds its place in information technology, query languages for XML attract much attention. Among them XPath is the most known. This article reveals a surprising fact that ...
Pavel Hlousek
FOIKS
2004
Springer
15 years 6 months ago
Plan Databases: Model and Algebra
Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal mod...
Fusun Yaman, Sibel Adali, Dana S. Nau, Maria Luisa...
ICGI
2000
Springer
15 years 4 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...
116
Voted
ASWC
2009
Springer
15 years 4 months ago
Reasoning about Partially Ordered Web Service Activities in PSL
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
Michael Gruninger, Xing Tan
117
Voted
AAAI
2007
15 years 3 months ago
Forgetting Actions in Domain Descriptions
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
Esra Erdem, Paolo Ferraris