Sciweavers

496 search results - page 69 / 100
» Practical Reasoning for Very Expressive Description Logics
Sort
View
LPKR
1997
Springer
15 years 1 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
AAAI
2006
14 years 11 months ago
Inconsistencies, Negations and Changes in Ontologies
Ontology management and maintenance are considered cornerstone issues in current Semantic Web applications in which semantic integration and ontological reasoning play a fundament...
Giorgos Flouris, Zhisheng Huang, Jeff Z. Pan, Dimi...
66
Voted
SEMWEB
2005
Springer
15 years 3 months ago
Representing Web Service Policies in OWL-DL
Abstract. Recently, there have been a number of proposals for languages for expressing web service constraints and capabilities, with WSPolicy and WSPL leading the way. The propose...
Vladimir Kolovski, Bijan Parsia, Yarden Katz, Jame...
SWAP
2007
14 years 10 months ago
Semantic Nearest Neighbor Search in OWL Ontologies
Abstract. A nearest neighbor search procedure is presented, for retrieving resources in knowledge bases expressed in OWL. The procedure exploits a semidistance for annotated resour...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
CSL
2004
Springer
15 years 3 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...