• 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 Research Online
    • Book chapters
    • View Item
    • Home
    • Griffith Research Online
    • Book chapters
    • 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
  • Merging Logic Programs under Answer Set Semantics

    Thumbnail
    View/Open
    62776_1.pdf (112.8Kb)
    Author(s)
    Delgrande, James
    Schaub, Torsten
    Tompits, Hans
    Woltran, Stefan
    Griffith University Author(s)
    Schaub, Torsten
    Year published
    2009
    Metadata
    Show full item record
    Abstract
    This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P 1, ..., P n , the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. The first informally selects those models of the programs that vary the least from the models of the other programs. The second approach informally selects those models of a program P 0 that are closest to the models of programs P 1, ..., P n . P 0 can be thought of as ...
    View more >
    This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P 1, ..., P n , the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. The first informally selects those models of the programs that vary the least from the models of the other programs. The second approach informally selects those models of a program P 0 that are closest to the models of programs P 1, ..., P n . P 0 can be thought of as analogous to a set of database integrity constraints. We examine formal properties of these operators and give encodings for computing the mergings of a multiset of logic programs within the same logic programming framework. As a by-product, we provide a complexity analysis revealing that our operators do not increase the complexity of the base formalism.
    View less >
    Book Title
    Logic Programming
    Publisher URI
    https://link.springer.com/book/10.1007/978-3-642-02846-5
    DOI
    https://doi.org/10.1007/978-3-642-02846-5_17
    Copyright Statement
    © 2009 Springer. The attached file is reproduced here in accordance with the copyright policy of the publisher. Use hypertext link for access to the publisher's website.
    Publication URI
    http://hdl.handle.net/10072/30506
    Collection
    • Book chapters

    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