Using criticalities as a heuristic for Answer Set Programming

Files

Using criticalities as a heuristic for Answer Set Programming.pdf (136.12 KB)

Date

2004

Authors

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
9
downloads

Citation Stats

  • Share

Series

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.

Source Title

Logic Programming and Nonmonotonic Reasoning

Publisher

Springer, Berlin, Heidelberg

Course

Other identifiers

Book Title

Keywords

Abstraction Hierarchy, Answer Set, Answer Set Programming, Hierarchical Planning, Literals, Logic Programs, SMODELS, Criticality (Nuclear Fission), Logic Programming

Degree Discipline

Degree Level

Degree Name

Citation

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

Scholarly Publications - Computer Engineering

Language

English

Type

Conference Paper