12,577 research outputs found
Semantic Web Languages and Semantic Web Services as Application Areas for Answer Set Programming
In the Semantic Web and Semantic Web Services areas there are still unclear issues concerning an appropriate language. Answer Set Programming and ASP engines can be particularly interesting for Ontological Reasoning, especially in the light of ongoing discussions of non-Monotonic extensions for Ontology Languages. Previously, the main concern of discussions was around OWL and Description Logics. Recently many extensions and suggestions for Rule Languages and Semantic Web Languages pop up, particularly in the the context of Semantic Web Services, which involve the meta-data description of Services instaead of static data on the Web only. These lanuages involve SWRL, WSML, SWSL-Rules, etc. I want to give an outline of languages, challenges and initiatives in this area and where I think Answer Set Programming research can hook in. (30min)
Non classical concept representation and reasoning in formal ontologies
Formal ontologies are nowadays widely considered a standard tool for knowledge
representation and reasoning in the Semantic Web. In this context, they are expected to
play an important role in helping automated processes to access information. Namely:
they are expected to provide a formal structure able to explicate the relationships
between different concepts/terms, thus allowing intelligent agents to interpret, correctly,
the semantics of the web resources improving the performances of the search
technologies.
Here we take into account a problem regarding Knowledge Representation in general,
and ontology based representations in particular; namely: the fact that knowledge
modeling seems to be constrained between conflicting requirements, such as
compositionality, on the one hand and the need to represent prototypical information on
the other. In particular, most common sense concepts seem not to be captured by the
stringent semantics expressed by such formalisms as, for example, Description Logics
(which are the formalisms on which the ontology languages have been built). The aim
of this work is to analyse this problem, suggesting a possible solution suitable for
formal ontologies and semantic web representations.
The questions guiding this research, in fact, have been: is it possible to provide a formal
representational framework which, for the same concept, combines both the classical
modelling view (accounting for compositional information) and defeasible, prototypical
knowledge ? Is it possible to propose a modelling architecture able to provide different
type of reasoning (e.g. classical deductive reasoning for the compositional component
and a non monotonic reasoning for the prototypical one)?
We suggest a possible answer to these questions proposing a modelling framework able
to represent, within the semantic web languages, a multilevel representation of
conceptual information, integrating both classical and non classical (typicality based)
information. Within this framework we hypothesise, at least in principle, the coexistence of multiple reasoning processes involving the different levels of
representation
Towards a Rule Interchange Language for the Web
This articles discusses rule languages that are needed for a a
full deployment of the SemanticWeb. First, it motivates the need for such
languages. Then, it presents ten theses addressing (1) the rule and/or
logic languages needed on the Web, (2) data and data processing, (3)
semantics, and (4) engineering and rendering issues. Finally, it discusses
two options that might be chosen in designing a Rule Interchange Format
for the Web
Reason Maintenance - State of the Art
This paper describes state of the art in reason maintenance with a focus on its future usage in the KiWi project. To give a bigger picture of the field, it also mentions closely related issues such as non-monotonic logic and paraconsistency. The paper is organized as follows: first, two motivating scenarios referring to semantic wikis are presented which are then used to introduce the different reason maintenance techniques
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace,
or when agents search for a web service to perform some task, or even when
recruiting agencies match curricula and job profiles. In such open
environments, the objective of a matchmaking process is to discover best
available offers to a given request. We address the problem of matchmaking from
a knowledge representation perspective, with a formalization based on
Description Logics. We devise Concept Abduction and Concept Contraction as
non-monotonic inferences in Description Logics suitable for modeling
matchmaking in a logical framework, and prove some related complexity results.
We also present reasonable algorithms for semantic matchmaking based on the
devised inferences, and prove that they obey to some commonsense properties.
Finally, we report on the implementation of the proposed matchmaking framework,
which has been used both as a mediator in e-marketplaces and for semantic web
services discovery
A Goal-Directed Implementation of Query Answering for Hybrid MKNF Knowledge Bases
Ontologies and rules are usually loosely coupled in knowledge representation
formalisms. In fact, ontologies use open-world reasoning while the leading
semantics for rules use non-monotonic, closed-world reasoning. One exception is
the tightly-coupled framework of Minimal Knowledge and Negation as Failure
(MKNF), which allows statements about individuals to be jointly derived via
entailment from an ontology and inferences from rules. Nonetheless, the
practical usefulness of MKNF has not always been clear, although recent work
has formalized a general resolution-based method for querying MKNF when rules
are taken to have the well-founded semantics, and the ontology is modeled by a
general oracle. That work leaves open what algorithms should be used to relate
the entailments of the ontology and the inferences of rules. In this paper we
provide such algorithms, and describe the implementation of a query-driven
system, CDF-Rules, for hybrid knowledge bases combining both (non-monotonic)
rules under the well-founded semantics and a (monotonic) ontology, represented
by a CDF Type-1 (ALQ) theory. To appear in Theory and Practice of Logic
Programming (TPLP
Evaluating Knowledge Representation and Reasoning Capabilites of Ontology Specification Languages
The interchange of ontologies across the World Wide Web (WWW) and the cooperation among heterogeneous agents placed on it is the main reason for the development of a new set of ontology specification languages, based on new web standards such as XML or RDF. These languages (SHOE, XOL, RDF, OIL, etc) aim to represent the knowledge contained in an ontology in a simple and human-readable way, as well as allow for the interchange of ontologies across the web. In this paper, we establish a common framework to compare the expressiveness of "traditional" ontology languages (Ontolingua, OKBC, OCML, FLogic, LOOM) and "web-based" ontology languages. As a result of this study, we conclude that different needs in KR and reasoning may exist in the building of an ontology-based application, and these needs must be evaluated in order to choose the most suitable ontology language(s)
- …