WSAT (CC) - A fast local-search ASP solver

Lengning Liu; Mirosław Truszczyński

WSAT (CC) - A fast local-search ASP solver

Lengning Liu, Mirosław Truszczyński

Computer Science

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

Abstract

We describe WSAT(CC), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(CC) is a processing back-end for the logic PS⁺, a recently proposed formalism for answer-set programming.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning
Editors	Ilkka Niemela, Vladimir Lifschitz
Pages	351-355
Number of pages	5
ISBN (Electronic)	354020721X, 9783540207214
State	Published - 2004
Event	7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004 - Fort Lauderdale, United States Duration: Jan 6 2004 → Jan 8 2004

Publication series

Name	Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume	2923
ISSN (Print)	0302-9743

Conference

Conference	7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004
Country/Territory	United States
City	Fort Lauderdale
Period	1/6/04 → 1/8/04

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2004.

Funding

Funders	Funder number
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China	0097278
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China	0325063

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Cite this

@inproceedings{eb18371c585540208da7ba749892259f,

title = "WSAT (CC) - A fast local-search ASP solver",

abstract = "We describe WSAT(CC), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(CC) is a processing back-end for the logic PS+, a recently proposed formalism for answer-set programming.",

author = "Lengning Liu and Miros{\l}aw Truszczy{\'n}ski",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2004.; 7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004 ; Conference date: 06-01-2004 Through 08-01-2004",

year = "2004",

language = "English",

series = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",

pages = "351--355",

editor = "Ilkka Niemela and Vladimir Lifschitz",

booktitle = "Logic Programming and Nonmonotonic Reasoning",

}

Liu, L & Truszczyński, M 2004, WSAT (CC) - A fast local-search ASP solver. in I Niemela & V Lifschitz (eds), Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), vol. 2923, pp. 351-355, 7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004, Fort Lauderdale, United States, 1/6/04.

WSAT (CC) - A fast local-search ASP solver. / Liu, Lengning; Truszczyński, Mirosław.
Logic Programming and Nonmonotonic Reasoning. ed. / Ilkka Niemela; Vladimir Lifschitz. 2004. p. 351-355 (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science); Vol. 2923).

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

TY - GEN

T1 - WSAT (CC) - A fast local-search ASP solver

AU - Liu, Lengning

AU - Truszczyński, Mirosław

PY - 2004

Y1 - 2004

N2 - We describe WSAT(CC), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(CC) is a processing back-end for the logic PS+, a recently proposed formalism for answer-set programming.

AB - We describe WSAT(CC), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(CC) is a processing back-end for the logic PS+, a recently proposed formalism for answer-set programming.

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

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

M3 - Conference contribution

AN - SCOPUS:9444253492

T3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

SP - 351

EP - 355

BT - Logic Programming and Nonmonotonic Reasoning

A2 - Niemela, Ilkka

A2 - Lifschitz, Vladimir

T2 - 7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004

Y2 - 6 January 2004 through 8 January 2004

ER -

WSAT (CC) - A fast local-search ASP solver

Abstract

Publication series

Conference

Bibliographical note

Funding

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this