{"type":"ScholarlyArticle","title":"Graph Theoretical Characterization and Computation of Answer Sets","authors":[{"name":"Thomas Linke","slug":"thomas-linke","given":"Thomas","family":"Linke","affiliation":""}],"abstract":"We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-standard graph coloring of so-called block graphs of logic programs. This leads us to an alternative implementation paradigm to compute answer sets, by computing non-standard graph colorings. Our approach is rule-based and not atom-based like most of the currently known methods. We present an implementation for computing answer sets which works on polynomial space.","doi":null,"url":"https://ijcai.org/proceedings/2001/89","pdf":"https://ijcai.org/proceedings/2001/0089.pdf","markdown":"https://ijcai.org/proceedings/2001/89.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/89","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":89,"pages":{"first":641,"last":647},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}