• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Theses
    • Theses - Higher Degree by Research
    • View Item
    • Home
    • Griffith Theses
    • Theses - Higher Degree by Research
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Syntax-Preserving Belief Change Operators for Logic Programs and Hybrid Knowledge Bases

    Thumbnail
    View/Open
    Binnewies_2016_01Thesis.pdf (719.8Kb)
    Author(s)
    Binnewies, Sebastian
    Primary Supervisor
    Stantic, Bela
    Wang, Kewen
    Year published
    2016
    Metadata
    Show full item record
    Abstract
    The recent years have seen several proposals aimed at placing the revision of logic programs within the belief change frameworks established for classical logic. A crucial challenge of this task lies in the nonmonotonicity of standard logic programming semantics. Existing approaches have thus used the monotonic characterisation via strong equivalence models to develop semantic revision operators, which however neglect any syntactic information. In this thesis, we bridge the gap between semantic and syntactic techniques by adapting three dierent types of constructions from classic belief change. Not only do they allow us to ...
    View more >
    The recent years have seen several proposals aimed at placing the revision of logic programs within the belief change frameworks established for classical logic. A crucial challenge of this task lies in the nonmonotonicity of standard logic programming semantics. Existing approaches have thus used the monotonic characterisation via strong equivalence models to develop semantic revision operators, which however neglect any syntactic information. In this thesis, we bridge the gap between semantic and syntactic techniques by adapting three dierent types of constructions from classic belief change. Not only do they allow us to dene new model-based revision operators that preserve the structure of the programs involved, but they also facilitate a natural denition of contraction operators for logic programs. In particular, we introduce partial meet revision and contraction operators, ensconcement revision and contraction operators, and entrenchment revision and contraction operators for logic programs. We present a new translation of the AGM and belief base revision and contraction postulates to logic programs that is closer to the original formulation than existing translations.
    View less >
    Thesis Type
    Thesis (PhD Doctorate)
    Degree Program
    Doctor of Philosophy (PhD)
    School
    School of Information and Communication Technology
    DOI
    https://doi.org/10.25904/1912/3817
    Copyright Statement
    The author owns the copyright in this thesis, unless stated otherwise.
    Item Access Status
    Public
    Subject
    Logic programs
    Syntax-preserving
    Belief change frameworks
    Semantic revision operators
    Publication URI
    http://hdl.handle.net/10072/365569
    Collection
    • Theses - Higher Degree by Research

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander