Implementing Modal Extensions of Defeasible Logic for the Semantic Web

Nikos Dimaresis, Grigoris Antoniou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Defeasible reasoning is a nonmonotonic reasoning approach in which the gaps due to incomplete information are closed through the use of defeasible rules. Defeasible logic (Nute 1994) and its variants are an important family of defeasible reasoning methods. It is a simple, efficient but flexible non-monotonic formalism that offers many reasoning capabilities embodies the concept of preference and it has low computational complexity. Recent theoretical work on defeasible logics has: (i) established some relationships to logic programming (Antoniou et al.2006); (ii) analyzed the formal properties of these logics
(Antoniou et al. 2001) and (iii) has delivered efficient implementations (Antoniou & Bikakis 2007).
Original languageEnglish
Title of host publicationAAAI-07/IAAI-07 Proceedings
Subtitle of host publication22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
Pages1848-1849
Number of pages2
Volume2
ISBN (Electronic)9781577353249
Publication statusPublished - 22 Jul 2007
Externally publishedYes
Event22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference - Vancouver, Canada
Duration: 22 Jul 200726 Jul 2007
Conference number: 22 / 19

Conference

Conference22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
Abbreviated titleAAAI-07 / IAAI-07
Country/TerritoryCanada
CityVancouver
Period22/07/0726/07/07

Fingerprint

Dive into the research topics of 'Implementing Modal Extensions of Defeasible Logic for the Semantic Web'. Together they form a unique fingerprint.

Cite this