Local-search techniques for propositional logic extended with cardinality constraints

Simple item page
dc.creatorLiu, Lengning
dc.creatorTruszczynski, Miroslaw
dc.date2003-10-31
dc.date.accessioned2026-07-07T03:20:31Z
dc.date.available2026-07-07T03:20:31Z
dc.descriptionWe 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.
dc.descriptionProceedings of the 9th International Conference on Pronciples and Practice of Constraint Programming - CP 2003, LNCS 2833, pp. 495-509
dc.identifierhttps://arxiv.org/abs/cs/0310061
dc.identifierhttp://arxiv.org/abs/cs/0310061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31855
dc.subjectArtificial Intelligence
dc.subjectI.2.8; F.4.1
dc.titleLocal-search techniques for propositional logic extended with cardinality constraints
dc.typetext

Files

Collections

arXiv