• 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
    • Conference outputs
    • View Item
    • Home
    • Griffith Research Online
    • Conference outputs
    • 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
  • Reasoning with Sequences of Point Events

    Thumbnail
    View/Open
    5126_1.pdf (324.9Kb)
    Author(s)
    Wetprasit, R
    Sattar, A
    Khatib, L
    Griffith University Author(s)
    Sattar, Abdul
    Year published
    1996
    Metadata
    Show full item record
    Abstract
    We propose to model recurring events as multipoint events by extending Vilain and Kautz's point algebra [7]. We then propose an exact algorithm based on van Beek's exact algorithm) forfinding feasi 6 le relations for multi-point event networks. The complexity of our method is compared with previously known results both for recurring and non-recurring events. We identify the special cases for which our multi-point based algorithm can find exact solution. Finally, we summarise our paper with brief discussion on ongoing and future research.We propose to model recurring events as multipoint events by extending Vilain and Kautz's point algebra [7]. We then propose an exact algorithm based on van Beek's exact algorithm) forfinding feasi 6 le relations for multi-point event networks. The complexity of our method is compared with previously known results both for recurring and non-recurring events. We identify the special cases for which our multi-point based algorithm can find exact solution. Finally, we summarise our paper with brief discussion on ongoing and future research.
    View less >
    Conference Title
    Proceedings of the International Workshop on Temporal Representation and Reasoning
    Publisher URI
    http://www.ieee.org/portal/site
    DOI
    https://doi.org/10.1109/TIME.1996.555672
    Copyright Statement
    © 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
    Subject
    Biosecurity science and invasive species ecology
    Publication URI
    http://hdl.handle.net/10072/19806
    Collection
    • Conference outputs

    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