Title: What is Constraint Answer Set Programming to Satisfiability Modulo Theories    

Abstract: Constraint Answer Set Programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories. In this talk, an exact formal link between the paradigms will be uncovered. Empirical results comparing performance of systems stemming from these different fields will be presented. By connecting these two areas, we hope to further promote the cross-fertilization of not only of the theoretical foundations of both areas, but also of the existing solving technologies.

Bio: Yuliya Lierler is an associate professor at the Computer Science Department at the University of Nebraska Omaha. Prior to coming to the University of Nebraska, Dr. Lierler was a Computing Innovation Fellow Postdoc at the University of Kentucky. She holds a Ph.D. in Computer Sciences from the University of Texas at Austin. Dr. Lierler’s research interests include the field of artificial intelligence, especially in the area of knowledge representation, automated reasoning, declarative problem solving, and natural language understanding.