482 search results - page 66 / 97 » Expressive probabilistic description logics |
KES
2007
Springer
2007
Springer
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
14 years 1 months ago
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
AIPS
2008
13 years 10 months ago
2008
As no plan can cover all possible contingencies, the ability to detect failures during plan execution is crucial to the robustness of any autonomous system operating in a dynamic ...
DIMACS
1996
13 years 9 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
SIGSOFT
2003
ACM
14 years 28 days ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...