Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints-Reference-Cited by-同舟云学术

Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints

Published:2003 Issue: Volume: Page:495-509
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2003
language:
Short-container-title:

Author:

Liu Lengning,Truszczyński Mirosław

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45193-8_34

Reference14 articles.

1. Aloul, F.A., Ramani, A., Markov, I., Sakallah, K.: Pbs: a backtrack-search pseudo-boolean solver and optimizer. In: Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability, pp. 346–353 (2002)

2. Barth, P.: A davis-putnam based elimination algorithm for linear pseudo-boolean optimization. Technical report, Max-Planck-Institut für Informatik, MPI-I- 95-2-003 (1995)

3. Lecture Notes in Computer Science;B. Benhamou,1994

4. Dixon, H.E., Ginsberg, M.L.: Inference methods for a pseudo-boolean satisfiability solver. In: The 18th National Conference on Artificial Intelligence (AAAI 2002) (2002)

5. Lecture Notes in Artificial Intelligence;D. East,2001

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Aggregating multi-valued CP-nets: a CSP-based approach;Journal of Heuristics;2014-12-30

2. A Stochastic Local Search Approach to Vertex Cover;Lecture Notes in Computer Science;2007

3. Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers;Logic Programming and Nonmonotonic Reasoning;2005

4. Applications of General Exact Satisfiability in Propositional Logic Modelling;Logic for Programming, Artificial Intelligence, and Reasoning;2005

5. Algorithms for Max Hamming Exact Satisfiability;Algorithms and Computation;2005