Sciweavers

1460 search results - page 231 / 292
» Preferential Description Logics
Sort
View
ESWS
2009
Springer
14 years 9 months ago
Towards an Agent Based Approach for Verification of OWL-S Process Models
Abstract. In this paper we investigate the transformation of OWL-S process models to ISPL - the system description language for MCMAS, a symbolic model checker for multi agent syst...
Alessio Lomuscio, Monika Solanki
DLOG
2011
14 years 3 months 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
DLOG
2011
14 years 3 months ago
The Complexity of Probabilistic EL
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
Jean Christoph Jung, Víctor Gutiérre...
FPGA
2006
ACM
224views FPGA» more  FPGA 2006»
15 years 3 months 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...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 2 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich