book chapter · Lecture notes in computer science · 2003

Definitions in Answer Set Programming

Cited by 34Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Erdoğan, S. T., & Lifschitz, V. (2003). Definitions in Answer Set Programming. Lecture notes in computer science, 483–484. https://doi.org/10.1007/978-3-540-24599-5_34

MLA 9

Erdoğan, Selim T., and Vladimir Lifschitz. “Definitions in Answer Set Programming.” Lecture notes in computer science, 2003, pp. 483–84, https://doi.org/10.1007/978-3-540-24599-5_34.

Chicago

Erdoğan, Selim T., and Vladimir Lifschitz. 2003. “Definitions in Answer Set Programming.” Lecture notes in computer science: 483–84. https://doi.org/10.1007/978-3-540-24599-5_34.

Harvard

Erdoğan, S.T. and Lifschitz, V. (2003) ‘Definitions in Answer Set Programming’, Lecture notes in computer science, pp. 483–484. Available at: https://doi.org/10.1007/978-3-540-24599-5_34.

BibTeX

@incollection{erdogan2003definitions,
  title = {{Definitions in Answer Set Programming}},
  author = {Erdoğan, Selim T. and Lifschitz, Vladimir},
  booktitle = {Lecture notes in computer science},
  pages = {483--484},
  year = {2003},
  doi = {10.1007/978-3-540-24599-5_34}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.