On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels)

@inproceedings{Giunchiglia2005OnTR,
  title={On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels)},
  author={Enrico Giunchiglia and Marco Maratea},
  booktitle={ICLP},
  year={2005}
}
Answer Set Programming (ASP) is a declarative paradigm for solving search problems. State-of-the-art systems for ASP include SMODELS, DLV , CMODELS, andASSAT. In this paper, our goal is to study the computational properties of such systems both from a theoretical and an experimental point of view. From the theoretical point of view, we start our analysis with CMODELS andSMODELS. We show that though these two systems are apparently different, they are equivalent on a significant class of… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS
20 Extracted Citations
23 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 23 references

ASP phase transition: A study on randomly generated programs

  • Fangzhen Lin, Yuting Zhao
  • InProc. ICLP,
  • 2003
1 Excerpt

Computing Answer Sets Using Program Completion

  • Yu. Babovich, V. Lifschitz
  • Available at http://www.cs.utexas.edu/users/tag…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…