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).
(Antoniou et al. 2001) and (iii) has delivered efficient implementations (Antoniou & Bikakis 2007).
Original language | English |
---|---|
Title of host publication | AAAI-07/IAAI-07 Proceedings |
Subtitle of host publication | 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference |
Pages | 1848-1849 |
Number of pages | 2 |
Volume | 2 |
ISBN (Electronic) | 9781577353249 |
Publication status | Published - 22 Jul 2007 |
Externally published | Yes |
Event | 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference - Vancouver, Canada Duration: 22 Jul 2007 → 26 Jul 2007 Conference number: 22 / 19 |
Conference
Conference | 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference |
---|---|
Abbreviated title | AAAI-07 / IAAI-07 |
Country/Territory | Canada |
City | Vancouver |
Period | 22/07/07 → 26/07/07 |