An smodels system with limited lookahead computation

Gayathri Namasivayam; Miroslaw Truszczyński

doi:10.1007/978-3-540-72200-7_26

An smodels system with limited lookahead computation

Gayathri Namasivayam, Miroslaw Truszczyński

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

We describe an answer-set programming solver smodels^-, derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels^- outperforms smodels and demonstrate the computational potential of our approach.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings
Pages	278-283
Number of pages	6
DOIs	https://doi.org/10.1007/978-3-540-72200-7_26
State	Published - 2007
Event	9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007 - Tempe, AZ, United States Duration: May 15 2007 → May 17 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4483 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007
Country/Territory	United States
City	Tempe, AZ
Period	5/15/07 → 5/17/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-72200-7_26

Cite this

Namasivayam, G., & Truszczyński, M. (2007). An smodels system with limited lookahead computation. In Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings (pp. 278-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4483 LNAI). https://doi.org/10.1007/978-3-540-72200-7_26

@inproceedings{56292b898db6489c88d6a48b6d1276d3,

title = "An smodels system with limited lookahead computation",

abstract = "We describe an answer-set programming solver smodels-, derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels- outperforms smodels and demonstrate the computational potential of our approach.",

author = "Gayathri Namasivayam and Miroslaw Truszczy{\'n}ski",

year = "2007",

doi = "10.1007/978-3-540-72200-7_26",

language = "English",

isbn = "9783540721994",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "278--283",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings",

note = "9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007 ; Conference date: 15-05-2007 Through 17-05-2007",

}

Namasivayam, G & Truszczyński, M 2007, An smodels system with limited lookahead computation. in Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4483 LNAI, pp. 278-283, 9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007, Tempe, AZ, United States, 5/15/07. https://doi.org/10.1007/978-3-540-72200-7_26

An smodels system with limited lookahead computation. / Namasivayam, Gayathri; Truszczyński, Miroslaw.
Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings. 2007. p. 278-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4483 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An smodels system with limited lookahead computation

AU - Namasivayam, Gayathri

AU - Truszczyński, Miroslaw

PY - 2007

Y1 - 2007

N2 - We describe an answer-set programming solver smodels-, derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels- outperforms smodels and demonstrate the computational potential of our approach.

AB - We describe an answer-set programming solver smodels-, derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels- outperforms smodels and demonstrate the computational potential of our approach.

UR - http://www.scopus.com/inward/record.url?scp=38049036865&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049036865&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-72200-7_26

DO - 10.1007/978-3-540-72200-7_26

M3 - Conference contribution

AN - SCOPUS:38049036865

SN - 9783540721994

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 278

EP - 283

BT - Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings

T2 - 9th International Conference on Logic Programming and Nonmonotomic Reasoning, LPNMR 2007

Y2 - 15 May 2007 through 17 May 2007

ER -

Namasivayam G, Truszczyński M. An smodels system with limited lookahead computation. In Logic Programming and Nonmonotonic Reasoning - 9th International Conference, LPNMR 2007, Proceedings. 2007. p. 278-283. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-72200-7_26

An smodels system with limited lookahead computation

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this