• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Using criticalities as a heuristic for Answer Set Programming

      Thumbnail
      View / Download
      136.1 Kb
      Author
      Sabuncu, O.
      Alpaslan, F. N.
      Akman, Varol
      Date
      2004
      Source Title
      Logic Programming and Nonmonotonic Reasoning
      Print ISSN
      0302-9743
      Publisher
      Springer, Berlin, Heidelberg
      Volume
      2923
      Pages
      234 - 246
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      142
      views
      109
      downloads
      Abstract
      Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used in this process is one of the key factors for the performance of the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic and is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. CSMODELS generally takes less time than SMODELS to find an answer set.
      Keywords
      Abstraction Hierarchy
      Answer Set
      Answer Set Programming
      Hierarchical Planning
      Literals
      Logic Programs
      SMODELS
      Criticality (Nuclear Fission)
      Logic Programming
      Permalink
      http://hdl.handle.net/11693/27483
      Published Version (Please cite this version)
      https://doi.org/10.1007/978-3-540-24609-1_21
      https://doi.org/10.1007/b94792
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy