Author name cluster

David Narváez

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers

1 author row

AAAI Conference 2018 Short Paper

Constraint Satisfaction Techniques for Combinatorial Problems

David Narváez

The last two decades have seen extraordinary advances in industrial applications of constraint satisfaction techniques, while combinatorial problems have been pushed to the sidelines. We propose a comprehensive analysis of the state of the art in constraint satisfaction problems when applied to combinatorial problems in areas such as graph theory, set theory, algebra, among others. We believe such a study will provide us with a deeper understanding about the limitations we still face in constraint satisfaction problems.

PDF Details

AAAI Conference 2018 Short Paper

Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems

David Narváez

In the context of SAT solvers, Shatter is a popular tool for symmetry breaking on CNF formulas. Nevertheless, little has been said about its use in the context of ALLSAT problems. ALLSAT has gained much popularity in recent years due to its many applications in domains like model checking, data mining, etc. One example of a particularly transparent application of ALLSAT to other ﬁelds of computer science is computational Ramsey theory. In this paper we study the effect of incorporating Shatter to the workﬂow of using Boolean formulas to generate all possible edge colorings of a graph avoiding prescribed monochromatic subgraphs. We identify two drawbacks in the naı̈ve use of Shatter to break the symmetries of Boolean formulas encoding Ramsey-type problems for graphs.

PDF Details