Sciweavers

1435 search results - page 281 / 287
» E-connections of Description Logics
Sort
View
WWW
2008
ACM
14 years 8 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
WWW
2008
ACM
14 years 8 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...
WWW
2007
ACM
14 years 8 months ago
Toward expressive syndication on the web
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
Christian Halaschek-Wiener, James A. Hendler
PADL
2009
Springer
14 years 8 months ago
Declarative Programming of User Interfaces
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
Christof Kluß, Michael Hanus
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard