1435 search results - page 125 / 287 » E-connections of Description Logics |
162
click to vote
CADE
1999
Springer
15 years 10 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
190
click to vote
FOIKS
2006
Springer
15 years 10 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
168
click to vote
WICSA
2004
15 years 7 months ago
2004
Software architecture descriptions can play a wide variety of roles in the software lifecycle, from requirements specification, to logical design, to implementation architectures....
183
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
The paper presents an ontology-based approach to service discovery, apt to support flexible and efficient matchmaking between service descriptions. We propose a hybrid approach th...
130
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...