Author of the publication

A Module-Based Framework for Multi-language Constraint Modeling.

, , , and . LPNMR, volume 5753 of Lecture Notes in Computer Science, page 155-168. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimal Neighborhood Preserving Visualization by Maximum Satisfiability., , , , , and . AAAI, page 1694-1700. AAAI Press, (2014)Limitations of restricted branching in clause learning., and . Constraints, 14 (3): 325-356 (2009)Implicit Hitting Set Algorithms for Reasoning Beyond NP., , and . KR, page 104-113. AAAI Press, (2016)Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity., , , and . J. Artif. Intell. Res., (2017)Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction., , , , and . Machine Learning, 107 (1): 247-283 (2018)Blocked Clause Elimination., , and . TACAS, volume 6015 of Lecture Notes in Computer Science, page 129-144. Springer, (2010)Formula Preprocessing in MUS Extraction., , and . TACAS, volume 7795 of Lecture Notes in Computer Science, page 108-123. Springer, (2013)Efficient CNF Simplification Based on Binary Implication Graphs., , and . SAT, volume 6695 of Lecture Notes in Computer Science, page 201-215. Springer, (2011)Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings., , and . AAAI, page 2938-2945. AAAI Press, (2019)Relating Proof Complexity Measures and Practical Hardness of SAT., , , and . CP, volume 7514 of Lecture Notes in Computer Science, page 316-331. Springer, (2012)