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

Lengning Liu, Mirosław Truszczyński

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning
EditorsIlkka Niemela, Vladimir Lifschitz
Pages351-355
Number of pages5
ISBN (Electronic)354020721X, 9783540207214
StatePublished - 2004
Event7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004 - Fort Lauderdale, United States
Duration: Jan 6 2004Jan 8 2004

Publication series

NameLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume2923
ISSN (Print)0302-9743

Conference

Conference7th International Conference on Logic Programming and Nonmonotonic Reasoning , LPNMR 2004
Country/TerritoryUnited States
CityFort Lauderdale
Period1/6/041/8/04

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2004.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'WSAT (CC) - A fast local-search ASP solver'. Together they form a unique fingerprint.

Cite this