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

Producción científica: Conference contribution › revisión exhaustiva

Resumen

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.

Idioma original	English
Título de la publicación alojada	Logic Programming and Nonmonotonic Reasoning
Editores	Ilkka Niemela, Vladimir Lifschitz
Páginas	351-355
Número de páginas	5
ISBN (versión digital)	354020721X, 9783540207214
Estado	Published - 2004
Evento	7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004 - Fort Lauderdale, United States Duración: ene 6 2004 → ene 8 2004

Serie de la publicación

Nombre	Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volumen	2923
ISSN (versión impresa)	0302-9743

Conference

Conference	7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004
País/Territorio	United States
Ciudad	Fort Lauderdale
Período	1/6/04 → 1/8/04

Nota bibliográfica

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2004.

Financiación

Financiadores	Número del financiador
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

Otros archivos y enlaces

Citar esto

@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. En 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.

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 - https://www.scopus.com/pages/publications/9444253492

UR - https://www.scopus.com/pages/publications/9444253492#tab=citedBy

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

Resumen

Serie de la publicación

Conference

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Otros archivos y enlaces

Huella

Citar esto