Sciweavers

1436 search results - page 190 / 288
» Description Logic Unplugged
Sort
View
JAPLL
2007
135views more  JAPLL 2007»
14 years 9 months ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
AIL
2000
78views more  AIL 2000»
14 years 9 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
SEMWEB
2004
Springer
15 years 3 months ago
Inferring Data Transformation Rules to Integrate Semantic Web Services
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
Bruce Spencer, Sandy Liu
DAC
2007
ACM
15 years 11 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
EDBT
2002
ACM
138views Database» more  EDBT 2002»
15 years 10 months ago
DAML+OIL: A Reason-able Web Ontology Language
Ontologies are set to play a key role in the "Semantic Web", extending syntactic interoperability to semantic interoperability by providing a source of shared and precise...
Ian Horrocks