On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint-Reference-Cited by-同舟云学术

On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint

Published:2007 Issue: Volume: Page:288-302
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Smaus Jan-Georg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72397-4_21

Reference21 articles.

1. Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: an update. In: Pileggi, L.T., Kuehlmann, A. (eds.) Proceedings of the 2002 IEEE/ACM International Conference on Computer-Aided Design, pp. 450–457. ACM Press, New York (2002)

2. Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 191–200 (2006)

3. Lecture Notes in Computer Science;P. Barth,1993

4. Barth, P., Bockmayr, A.: Solving 0-1 problems in CLP(PB). In: Proceedings of the 9th Conference on Artificial Intelligence for Applications, IEEE Computer Society Press, Los Alamitos (1993)

5. Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: Proceedings of the 40th Design Automation Conference, pp. 830–835. ACM Press, New York (2003)

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

1. Metodología para la síntesis de autómatas en la planificación de movimientos en sistemas autónomos con múltiples agentes;Tecnura;2021-10-01

2. BDDs for Pseudo-Boolean Constraints – Revisited;Theory and Applications of Satisfiability Testing - SAT 2011;2011

3. On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2007