Macquarie Home | Course Handbook | Library | Campus Map | Macquarie Contacts
Home page

Macquarie University ResearchOnline

Home
Add
-List Of Titles -Preference-based belief revision for rule-based agents

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/78368

OpenURL Link
15 Visitors 17 Hits 0 Downloads
Title
Preference-based belief revision for rule-based agents
Related
Synthese, Vol. 165, No. 2, p.159-177
DOI
10.1007/s11229-008-9364-0
Publisher
Springer
Date
2008
FoR/RFCD Code(s)
220200 History and Philosophy of Specific Fields  220300 Philosophy
Author/Creator
Alechina, Natasha
Author/Creator
Jago, Mark
Author/Creator
Logan, Brian
Description
Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation.
Description
19 page(s)
Subject Keyword
220200 History and Philosophy of Specific Fields
Subject Keyword
220300 Philosophy
Subject Keyword
belief revision
Subject Keyword
reason maintenance systems
Subject Keyword
preferences
Subject Keyword
rule-based agents
Resource Type
journal article
Organisation
Macquarie University. Dept. of Philosophy

Identifier
http://hdl.handle.net/1959.14/78368
Identifier
ISSN:1573-0964
Identifier
mq-rm-2008001458
Language
eng
Reviewed
Reviewed
Save/E-mail Citation
Citation Format
E-mail Address
Subject
"Synthese"
 
OR
  • Show All  
  • Show My Selections 
Advanced Search

Search

Browse

  • By Title 
  • By Author/Creator 
  • By Department/Centre 
  • By Subject Keyword 
  • By Journal/Conference 
  • By FoR/RFCD codes 
  • By Resource Type 
  • By Date 

Highlights

  • Most Accessed Objects 
  • Recent Additions 
  • Pending Publications 
  • Author Profiles 

Resources

  • About ResearchOnline 
  • FAQ 
  • Open Access 
  • Open Access-FAQs 
  • Copyright 
  • Contribute 
  • Help 
  • Contact
  • Terms and Conditions 
Valid XHTML 1.0 Strict Powered by VITAL

Copyright Macquarie University | Privacy Statement | Accessibility Information

ABN 90 952 801 237 | CRICOS Provider No 00002J

Library Staff Sign In