17 search results - page 3 / 4 » Ontology Merging using Answer Set Programming and Linguistic... |
ASP
2005
Springer
14 years 28 days ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
ASP
2005
Springer
14 years 28 days ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
MUC
1992
13 years 11 months ago
1992
The GE NLTooLsET is a set of text interpretation tools designed to be easily adapted to new domains. This report summarizes the system and its performance on the MUG-4 task . INTR...