Skip to main content
SpringerLink
Log in

WSAT(CC) — A Fast Local-Search ASP Solver

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2923))

  • 351 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dransfield, M.R., Marek, V.M., Truszczyński, M.: Satisfiability and computing van der Waerden numbers. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 1–13. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. East, D., Liu, L., Logsdon, S., Marek, V., Truszczyński, M.: ASPPS user’s manual (2003), http://www.cs.uky.edu/aspps/users_manual.ps

  3. East, D., Truszczyński, M.: Propositional satisfiability in answer-set programming. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, p. 138. Springer, Heidelberg (2001), available at http://xxx.lanl.gov/abs/cs.LO/0211033

    Chapter  Google Scholar 

  4. Liu, L., Truszczyński, M.: Local-search techniques in propositional logic extended with cardinality atoms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 495–509. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Niemelä, I., Simons, P.: Extending the smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491–521. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  6. Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of AAAI 1994. AAAI Press, Menlo Park (1994)

    Google Scholar 

  7. Walser, J.P.: Solving linear pseudo-boolean constraints with local search. In: Proceedings of AAAI 1997. AAAI Press, Menlo Park (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, Lexington, KY, 40506-0046, USA

    Lengning Liu & Mirosław Truszczyński

Authors
  1. Lengning Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mirosław Truszczyński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Texas at Austin, USA

    Vladimir Lifschitz

  2. Department of Information and Computer Science, Helsinki University of Technology TKK,  

    Ilkka Niemelä

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, L., Truszczyński, M. (2003). WSAT(CC) — A Fast Local-Search ASP Solver. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24609-1_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20721-4

  • Online ISBN: 978-3-540-24609-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation