Sciweavers

342 search results - page 49 / 69
» Tableau Algorithms for Description Logics
Sort
View
FPGA
2006
ACM
224views FPGA» more  FPGA 2006»
14 years 9 days ago
Flexible implementation of genetic algorithms on FPGAs
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
Tatsuhiro Tachibana, Yoshihiro Murata, Naoki Shiba...
WWW
2005
ACM
14 years 9 months ago
Automated semantic web services orchestration via concept covering
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
14 years 2 months ago
Scheduling under resource constraints using dis-equations
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
Hadda Cherroun, Alain Darte, Paul Feautrier
DLOG
2006
13 years 10 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
DLOG
2011
13 years 5 days ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan