Show simple item record

dc.contributor.authorSabuncu, O.en_US
dc.contributor.authorAlpaslan, F. N.en_US
dc.contributor.authorAkman, Varolen_US
dc.coverage.spatialFort Lauderdale, FL, USAen_US
dc.date.accessioned2016-02-08T11:54:37Z
dc.date.available2016-02-08T11:54:37Zen_US
dc.date.issued2004en_US
dc.identifier.isbn978-3-540-20721-4en_US
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27483en_US
dc.descriptionConference name: LPNMR: International Conference on Logic Programming and Nonmonotonic Reasoning 7th International Conferenceen_US
dc.descriptionDate of Conference: 6-8 January 2004en_US
dc.description.abstractAnswer 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.en_US
dc.language.isoEnglishen_US
dc.source.titleLogic Programming and Nonmonotonic Reasoningen_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-24609-1_21en_US
dc.relation.isversionofhttps://doi.org/10.1007/b94792en_US
dc.subjectAbstraction Hierarchyen_US
dc.subjectAnswer Seten_US
dc.subjectAnswer Set Programmingen_US
dc.subjectHierarchical Planningen_US
dc.subjectLiteralsen_US
dc.subjectLogic Programsen_US
dc.subjectSMODELSen_US
dc.subjectCriticality (Nuclear Fission)en_US
dc.subjectLogic Programmingen_US
dc.titleUsing criticalities as a heuristic for Answer Set Programmingen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage234en_US
dc.citation.epage246en_US
dc.citation.volumeNumber2923en_US
dc.identifier.doi10.1007/978-3-540-24609-1_21en_US
dc.identifier.doi10.1007/b94792en_US
dc.publisherSpringer, Berlin, Heidelbergen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record