(aside image)

Research Focus

The Computational Logic Group develops automated reasoning techniques for solving challenging computational problems in engineering and science. The current focus is on efficient computational methods for solving large constraint satisfaction problems formally represented as Boolean satisfiability (SAT) problems or their generalizations, or expressed in terms of rule-based constraints used in answer-set programming (ASP). The group has a strong track record in research on verification and testing of automation systems and software, as well as applying formal methods in the analysis of distributed systems.

July 3—6, 2017: The LPNMR 2017 Conference
December 8, 2016: Computational Logic Day 2016