A Nonmonotonic Rule System using Ontologies

tags

Semantic Web Grigoris Antoniou

Notes

DAML+OIL was designed to be sufficiently rich to be useful in applications, while being simple enough to allow for efficient reasoning support. In fact, it corresponds to an expressive description logic.

NOTER_PAGE: (1 . 0.5930599369085174)

defeasible reasoning is arguably one of the most successful subarea in nonmonotonic reasoning

NOTER_PAGE: (2 . 0.261198738170347)

One important advantage of such systems is their focus on implementability and their low computational complexity

NOTER_PAGE: (2 . 0.3047318611987382)

defeasible ontologies can be built

NOTER_PAGE: (2 . 0.49463722397476345)

Rule- based systems define ontology-based applications using vocabulary defined in description logic.

NOTER_PAGE: (2 . 0.5047318611987383)

we will study defeasible reasoning [21] running on top of description logics.

NOTER_PAGE: (2 . 0.5570977917981073)

both Horn logic and description logics are subsets of predicate logic. Therefore seman- tically there is no difficulty at all, and the focus of work on hybrid reasoning has been on efficient algorithms and limits of computability.

NOTER_PAGE: (2 . 0.5993690851735016)

if one wants to use a declarative approach, with all the benefits that follow for maintainability and formal analysis, then nonmonotonic rules are the way to go.

NOTER_PAGE: (4 . 0.21451104100946375)

A defeasible theory (a knowledge base in defeasible logic) consists of three different kinds of knowledge: strict rules, defeasible rules, and a superiority relation.

NOTER_PAGE: (5 . 0.44164037854889593)

hybrid proof theory in which description logic reasoning and defeasible reasoning are interleaved.

NOTER_PAGE: (11 . 0.310410094637224)