Sciweavers

427 search results - page 59 / 86
» e-Service Composition by Description Logics Based Reasoning
Sort
View
LPAR
2004
Springer
15 years 11 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CADE
2005
Springer
16 years 6 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
LOGCOM
2007
130views more  LOGCOM 2007»
15 years 5 months ago
A Logic for Concepts and Similarity
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
DLOG
2007
15 years 8 months ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong
KR
2004
Springer
15 years 11 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka