1435 search results - page 100 / 287 » E-connections of Description Logics |
STACS
2000
Springer
15 years 4 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
113
click to vote
IJCAI
1989
15 years 2 months ago
1989
Mechanical systems, of the kinds which are of interest for qualitative reasoning, are characterized by a set of real-valued parameters, each of which is a piecewise continuous fun...
BIRTHDAY
1991
Springer
15 years 4 months ago
1991
Springer
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
155
click to vote
ECOWS
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...
115
click to vote
AICOM
2006
15 years 1 months ago
2006
This paper presents an overview of recent systems for Inductive Logic Programming (ILP). After a short description of the two popular ILP systems FOIL and Progol, we focus on meth...