Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Knowledge Base
Logic Programs
Semantic Web
Stable Model Semantics
Well Founded Semantics
Related Publications
(5)
WellFounded Semantics for Description Logic Programs in the Semantic Web
An Epistemic Operator for Description Logics
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
Wellfounded semantics for general logic programs
Tabled evaluation with delaying for general logic programs
Subscribe
Academic
Publications
A Coherent Wellfounded Model for Hybrid MKNF Knowledge Bases
A Coherent Wellfounded Model for Hybrid MKNF Knowledge Bases,10.3233/978158603891599,Matthias Knorr,José Júlio Alferes,Pascal Hitzler
Edit
A Coherent Wellfounded Model for Hybrid MKNF Knowledge Bases
(
Citations: 21
)
BibTex

RIS

RefWorks
Download
Matthias Knorr
,
José Júlio Alferes
,
Pascal Hitzler
With the advent of the Semantic Web, the question be comes important how to best combine openworld based ontology languages, like OWL, with closedworld rules paradigms. One of the most mature proposals for this combination is known as Hybrid MKNF knowledge bases (11), which is based on an adaptation of the
stable model semantics
to knowledge bases consisting of ontology axioms and rules. In this paper, we propose a wellfounded semantics for such knowledge bases which promises to provide better efficiency of reasoning, which is compatible both with the OWLbased seman tics and the traditional wellfounded semantics for logic programs, and which surpasses previous proposals for such a wellfounded se mantics by avoiding some issues related to inconsistency handling.
Conference:
European Conference on Artificial Intelligence  ECAI
, pp. 99103, 2008
DOI:
10.3233/978158603891599
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dx.doi.org
)
(
centria.fct.unl.pt
)
(
wwwia.di.fct.unl.pt
)
(
www.informatik.unitrier.de
)
(
www.aifb.unikarlsruhe.de
)
(
knoesis.wright.edu
)
More »
Citation Context
(15)
...6A short version of this paper appeared in [
29
]...
...9In comparison to [
29
] the denition has been slightly altered to simplify proofs and computation: in case of a total interpretation pair (M;M) it is sucient to check that no other total interpretation pair (M0;M0) actually yields a true evaluation for all I0 2 M0. This simplica...
Matthias Knorr
,
et al.
Local closed world reasoning with description logics under the wellfo...
...Interaction between O and P is either oneway (O affects P) or twoway (where P may also affect O). The approach of defining a knowledge base as a pair �O , P� is adopted in a considerable number of works: [7] (on ALlog), [17] (on CARIN), [19] (on DLsafe rules), [28] (on DL+log), [18], [
16
] (on hybrid MKNF), [8] (on hybrid programs), [11] (on dlprograms)...
...This differs from all the above mentioned works [7], [17], [19], [28], [18], [
16
], [8], [11]...
Son Thanh Cao
,
et al.
WORL: A Web Ontology Rule Language
...
Knorr et al. [2008]
have recently proposed an extension of MKNF knowledge bases to the wellfounded semantics [van Gelder et al. 1991]...
Boris Motik
,
et al.
Reconciling description logics and rules
...edge bases (MKNFWFS), introduced in [
7
] and overviewed in Section 2 below, is the only one which allows knowledge about instances to be fully interdefinable between rules and an ontology that is taken as a parameter of the formalism...
...The wellfounded MKNF semantics as presented in [
7
] is based on a complete threevalued extension of the original MKNF semantics...
...However, here, as we are only interested in querying for literals and conjunctions of literals, we limit ourselves to the computation of what is called the wellfounded partition in [
7
]: basically the atoms which are true and false...
...At first, we recall some notions from [
7
] which will be useful in the definition of the operators for obtaining that wellfounded model...
...We continue now by recalling the definition in [
7
] of an operator TK which allows conclusions to be drawn from positive hybrid MKNF knowledge bases...
...The operator TK is shown to be monotonic in [
7
] so, by the KnasterTarski theorem, it has a unique least fixpoint, denoted lfp(TK), which is reached after a finite number of iteration steps...
...Both operators are shown to be antitonic [
7
], hence their composition is monotonic and form the basis for defining the wellfounded MKNF model...
...Note that by finiteness of the ground knowledge base the iteration stops before reaching ω. It was shown in [
7
] that the sequences are monotonically increasing, decreasing respectively, and that Tω and TUω form the wellfounded model:...
...As shown in [
7
], the well founded model is sound with respect to the original semantics of [10], i.e...
...In fact, the relation between the semantics of [
7
] and [10], is tantamount to that of the well founded semantics and the answersets semantics of logic programs...
...The algorithm shown in Figure 1 creates two different sets corresponding to the application of the operator Γ of the MKNFWFS [
7
]...
...The system answers queries according to MKNFWFS [
7
] and, as such, is also sound w.r.t...
...The definition of MKNFWFS is parametric on a decidable description logic (in which the ontology is written), and it is worth noting that, as shown in [
7
], the complexity of reasoning in MKNFWFS is in the same class as that in the decidable description logic; a complexity result that is extended to a querydriven approach in [1]...
...For a survey on these proposals, see [6], and [10,
7
] for comparisons to MKNF...
Ana Sofia Gomes
,
et al.
Implementing Query Answering for Hybrid MKNF Knowledge Bases
...Recently, also hybrid rule combinations based on the wellfounded semantics have been proposed by Drabent et al. [7 ]o r Knorr et al. [
18
], defining an analogous, modular...
Jos de Bruijn
,
et al.
A semantical framework for hybrid knowledge bases
References
(14)
Embedding NonGround Logic Programs into Autoepistemic Logic for KnowledgeBase Combination
(
Citations: 26
)
Jos De Bruijn
,
Thomas Eiter
,
Axel Polleres
,
Hans Tompits
Conference:
International Joint Conference on Artificial Intelligence  IJCAI
, pp. 304309, 2007
WellFounded Semantics for Description Logic Programs in the Semantic Web
(
Citations: 65
)
Thomas Eiter
,
Thomas Lukasiewicz
,
Roman Schindlauer
,
Hans Tompits
Conference:
Rules and Rule Markup Languages for the Semantic Web  RULEML
, pp. 8197, 2004
The Stable Model Semantics for Logic Programming
(
Citations: 1790
)
Michael Gelfond
,
Vladimir Lifschitz
Conference:
International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming  ICLP(JICSLP)
, pp. 10701080, 1988
Guarded Open Answer Set Programming
(
Citations: 25
)
Stijn Heymans
,
Davy Van Nieuwenborgh
,
Dirk Vermeir
Conference:
Logic Programming and Nonmonotonic Reasoning  LPNMR
, pp. 92104, 2005
A uniform approach to logic programming semantics
(
Citations: 22
)
Pascal Hitzler
,
Matthias Wendt
Journal:
Theory and Practice of Logic Programming  TPLP
, vol. 5, no. 12, pp. 93121, 2005
Sort by:
Citations
(21)
Wellfounded semantics for description logic programs in the semantic web
(
Citations: 4
)
Thomas Eiter
,
Giovambattista Ianni
,
Thomas Lukasiewicz
,
Roman Schindlauer
Journal:
ACM Transactions on Computational Logic  TOCL
, vol. 12, no. 2, pp. 141, 2011
Local closed world reasoning with description logics under the wellfounded semantics
(
Citations: 2
)
Matthias Knorr
,
José Júlio Alferes
,
Pascal Hitzler
Journal:
Artificial Intelligence  AI
, vol. 175, no. 910, pp. 15281554, 2011
WORL: A Web Ontology Rule Language
Son Thanh Cao
,
Linh Anh Nguyen
,
Andrzej Szalas
Conference:
International Conference on Knowledge and Systems Engineering  KSE
, 2011
Reconciling description logics and rules
(
Citations: 16
)
Boris Motik
,
Riccardo Rosati
Journal:
Journal of The ACM  JACM
, vol. 57, no. 5, pp. 162, 2010
Implementing Query Answering for Hybrid MKNF Knowledge Bases
(
Citations: 4
)
Ana Sofia Gomes
,
José Júlio Alferes
,
Terrance Swift
Conference:
Practical Aspects of Declarative Languages  PADL
, pp. 2539, 2010