A defeasible logic of policy-based intention

dc.contributor.author Governatori, Guido
dc.contributor.author Padmanabhan, Vineet
dc.date.accessioned 2022-03-27T05:51:35Z
dc.date.available 2022-03-27T05:51:35Z
dc.date.issued 2003-01-01
dc.description.abstract Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [8] exhibit non-monotonic behaviour which could be captured through a non-monotonic system like defeasible logic. To this end we outline a defeasible logic of intention. The proposed technique alleviates most of the problems related to logical omniscience. The proof theory given shows how our approach helps in the maintenance of intention-consistency in agent systems like BDI.
dc.identifier.citation Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.2903
dc.identifier.issn 03029743
dc.identifier.uri 10.1007/978-3-540-24581-0_35
dc.identifier.uri http://link.springer.com/10.1007/978-3-540-24581-0_35
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/8413
dc.title A defeasible logic of policy-based intention
dc.type Book Series. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: