• 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
  • Model-Based Knowledge Representation and Reasoning Via Answer Set Programming

    Thumbnail
    View/Open
    55635_1.pdf (33.33Kb)
    Author(s)
    Schaub, Torsten
    Griffith University Author(s)
    Schaub, Torsten
    Year published
    2008
    Metadata
    Show full item record
    Abstract
    The field of knowledge representation and reasoning has been going through a methodological shift during recent years. While the past was dominated by query-oriented reasoning, model-based techniques become more and more popular nowadays. This development was primarily driven by the availability of highly efficient Boolean constraint solvers, like satisfiability and answer set solvers. The general idea is to translate an application problem into a logical specification. This specification is in turn passed to a solver, which outputs models representing solutions to the initial application problem. The talk will provide an ...
    View more >
    The field of knowledge representation and reasoning has been going through a methodological shift during recent years. While the past was dominated by query-oriented reasoning, model-based techniques become more and more popular nowadays. This development was primarily driven by the availability of highly efficient Boolean constraint solvers, like satisfiability and answer set solvers. The general idea is to translate an application problem into a logical specification. This specification is in turn passed to a solver, which outputs models representing solutions to the initial application problem. The talk will provide an introduction to answer set programming (ASP), its proof-theoretic foundations, methodology, implementation techniques along with a glimpse of an exemplary application. Besides knowledge representation and reasoning, ASP has its roots in deductive databases, nonmonotonic reasoning, and logic programming. Applications are specified in ASP in terms of sets of logical rules. Modern ASP solvers rely on high-performance Boolean constraint solving techniques, which allow them to tackle application domains consisting of millions of variables. Meanwhile, this approach proved to be an effective tool in a range of applications, like planning, model checking, and bio-informatics.
    View less >
    Conference Title
    Proceedings 9th International Symposium on Functional and Logic Programming (FLOPS 2008)
    DOI
    https://doi.org/10.1007/978-3-540-78969-7_1
    Copyright Statement
    © 2008 Springer Berlin/Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com
    Publication URI
    http://hdl.handle.net/10072/37092
    Collection
    • Conference outputs

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E

    Tagline

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