Your browser does not support JavaScript!

Home    Collections    Type of Work    Post-graduate theses  

Post-graduate theses

Current Record: 4761 of 6472

Back to Results Previous page
Next page
Add to Basket
[Add to Basket]
Identifier uch.csd.msc//2004bikakis
Title Ανάπτυξη Συστήματος Αναιρέσιμων Κανόνων για το Διαδίκτυο
Alternative Title A System for Nonmonotonic Rules on the Web
Creator Bikakis, Antonis
Abstract The Semantic Web is an extension of the current Web, in which information is given well-defined meaning, better enabling computers and people to work in cooperation. For the Semantic Web to function, computers must have access to structured collections of information and sets of inference rules that they can use to conduct automated reasoning. The development of the Semantic Web proceeds in layers, each layer being on top of other layers. At present, the highest layer that has reached sufficient maturity is the ontology layer in the form of the description logic based languages. The next step will be the logic and proof layer and rule systems appear to lie in the mainstream of such activities. Until now, most studies on this domain have focused on the development of monotonic rule systems. A logic is monotonic if the truth of a proposition does not change when new information (axioms) are added to the system - the set of conclusions can only monotonically grow. In contrast, a logic is non-monotonic if the truth of a proposition may change when new information (axioms) is added - the set of conclusions may either grow or shrink. The study of nonmonotonic rule systems seem also to be promising for the development of the Web, as nonmonotonic reasoning is closer to commonsense reasoning, compared to monotonic logics. In the current work, we are developing a nonmonotonic rule system, which is based on defeasible logic. The system can reason both with monotonic (strict) and nonmonotonic (defeasible) rules, and supports preferences between rules. It can treat facts in RDF form and ontologies in RDFS, and its user interface is compatible with RuleML, the main standardization effort for rules on the Semantic Web. The core of the system consists of a translation of defeasible knowledge into Prolog. However, the implementation is declarative because it interprets the not operator using Well-Founded Semantics.
Issue date 2004-11-01
Date available 2005-02-07
Collection   School/Department--School of Sciences and Engineering--Department of Computer Science--Post-graduate theses
  Type of Work--Post-graduate theses
Permanent Link https://elocus.lib.uoc.gr//dlib/e/2/f/metadata-dlib-2004bikakis.tkl Bookmark and Share
Views 436

Digital Documents
No preview available

Download document
View document
Views : 7