Local-search techniques for propositional logic extended with cardinality constraints

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardinalities of sets. Adding cardinality atoms to the language of propositional logic facilitates modeling search problems and often results in concise encodings. We propose two ``native'' local-search solvers for theories in the extended language. We also describe techniques to reduce the problem to standard propositional satisfiability and allow us to use off-the-shelf SAT solvers. We study these methods experimentally. Our general finding is that native solvers designed specifically for the extended language perform better than indirect methods relying on SAT solvers.
Proceedings of the 9th International Conference on Pronciples and Practice of Constraint Programming - CP 2003, LNCS 2833, pp. 495-509

Keywords

Artificial Intelligence, I.2.8; F.4.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31855

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0310061
 http://arxiv.org/abs/cs/0310061

Collections

arXiv