Sciweavers

4623 search results - page 856 / 925
» Knowledge Representation on the Web
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
WWW
2004
ACM
14 years 10 months ago
Incremental formalization of document annotations through ontology-based paraphrasing
For the manual semantic markup of documents to become widespread, users must be able to express annotations that conform to ontologies (or schemas) that have shared meaning. Howev...
Jim Blythe, Yolanda Gil
ICSE
2007
IEEE-ACM
14 years 10 months ago
Modeling in Software Engineering
A data model is a plan for building a database and is comparable to an architect's building plans. There are two major methodologies used to create a data model: the EntityRe...
Joanne M. Atlee, Robert B. France, Geri Georg, Ana...
KCAP
2005
ACM
14 years 3 months ago
Semantic Association of Taxonomy-based Standards Using Ontology
The vision of semantic interoperability, the fluid sharing of digitalized knowledge, has led much research on ontology/schema mapping/aligning. Although this line of research is f...
Hung-Ju Chu, Randy Y. C. Chow, Su-Shing Chen, Raja...
BIRTHDAY
2005
Springer
14 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau