Citation Context

...ssible, in the sense that conclusions from the rules affect the conclusions from the ontology and vice-versa. Among such proposals are several whose semantics is based on stable model semantics (SMS) =-=[5]-=- (e.g. [2, 3, 6, 11, 13]), and only few which are based on the well-founded semantics (WFS) [14], like [4, 8]. Though these WFS-based approaches are in general weaker in their derivable consequences, ...

Citation Context

...nd vice-versa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. [2, 3, 6, 11, 13]), and only few which are based on the well-founded semantics (WFS) =-=[14]-=-, like [4, 8]. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation (data complexity P vs. NP) should be more suitable for the intended app...

Citation Context

... the sense that conclusions from the rules affect the conclusions from the ontology and vice-versa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. =-=[2, 3, 6, 11, 13]-=-), and only few which are based on the well-founded semantics (WFS) [14], like [4, 8]. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation...

Citation Context

... the sense that conclusions from the rules affect the conclusions from the ontology and vice-versa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. =-=[2, 3, 6, 11, 13]-=-), and only few which are based on the well-founded semantics (WFS) [14], like [4, 8]. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation...

Citation Context

...ant how to best combine open-world based ontology languages, like OWL, with closed-world 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 well-founded semantics for such knowledge bases ...

Citation Context

... the WWW. One of the currently most mature proposals for a tight integration is known as Hybrid MKNF knowledge bases [11], which draws on the logic of Minimal Knowledge and Negation as Failure (MKNF) =-=[10]-=-. [11]’s proposal evaluates knowledge bases under a stable model semantics, resulting in unfavorable computational complexities. In this paper, we therefore define a new semantics, restricted to non-d...

Citation Context

...sa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. [2, 3, 6, 11, 13]), and only few which are based on the well-founded semantics (WFS) [14], like =-=[4, 8]-=-. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation (data complexity P vs. NP) should be more suitable for the intended application area...

Citation Context

... the sense that conclusions from the rules affect the conclusions from the ontology and vice-versa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. =-=[2, 3, 6, 11, 13]-=-), and only few which are based on the well-founded semantics (WFS) [14], like [4, 8]. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation...

Citation Context

... the sense that conclusions from the rules affect the conclusions from the ontology and vice-versa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. =-=[2, 3, 6, 11, 13]-=-), and only few which are based on the well-founded semantics (WFS) [14], like [4, 8]. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation...

Citation Context

...at the knowledge base is inconsistent, as we shall see in the following section, and the (2) and (3) alone are not suitable to provide the intended service. 5 Properties In the same manner as done in =-=[7]-=- for the alternating fixpoint of normal logic programs, we restate the iteration for obtaining ΦK and ΨK as: P0 = ∅ N0 = KA( b K) Pn+1 = ΓK(Nn) Nn+1 = Γ ′ K(Pn) Pω = S Pn Nω = T Nn It is easy to see t...

Citation Context

...sa. Among such proposals are several whose semantics is based on stable model semantics (SMS) [5] (e.g. [2, 3, 6, 11, 13]), and only few which are based on the well-founded semantics (WFS) [14], like =-=[4, 8]-=-. Though these WFS-based approaches are in general weaker in their derivable consequences, their faster computation (data complexity P vs. NP) should be more suitable for the intended application area...