51ÉçÇø

Members

51ÉçÇø (UNO) Daniel Bresnahan Zachary Hansen Eleuterio Juan Lillo Portero

University of Kentucky (UK) Liu Liu

Collaborators Giovanni Amendola Pedro Cabalar Marc Denecker Jorge Fandinno Francesco Ricca Joost Vennekens

Alumni Mohan Ambati Michael Dingess Nicholas Hippen Brian Hodges John Hare Da Shen Jacob Lee Shelby Stocker Daniel Houston Daniel Bresnahan Justin Robbins Will Kimmerer

Project Summary

The project aims to address critical outstanding challenges in answer set programming, a leading knowledge representation/declarative constraint programming paradigm. Answer set programming has its roots in the need to support fast design of robust and reliable software solutions for complex knowledge-intensive applications. It reduces the programming task to modeling an application domain as a theory in a language of logic, and leaves all computational concerns to automated reasoning. Answer set programming has been successfully used in scientific and industrial applications.

The main goal of the project is to develop automated, integrated methods and algorithms to synergistically optimize answer set programs, select appropriate solvers, and optimally configure their parameters, each task mindful of and informed by the two others. The underlying objectives are to support a systematic and principled process for building fast, scalable answer set programming solutions, and to make the declarative answer set programming technology the method of choice in a broad range of complex knowledge-intensive practical applications.

The project is sponsored under NSF grant 1707371.

The results () on the University of Kentucky Component of the project are hosted .

Software (UNO Component)

• PROJECTOR
• PREDICTOR
• DualGrounder

Publications (UNO Component)

• - Jorge Fandinno, Zach Hansen and Yuliya Lierler - AAAI - 2022
• - Liu Liu, Miroslaw Truszczyński and Yuliya Lierler - LPNMR - 2022
• - Jorge Fandinno, Zachary Hansen and Yuliya Lierler - LPNMR - 2022
• - Zachary Hansen and Yuliya Lierler - LPNMR - 2022
• - Daniel Bresnahan, Nicholas Hippen and Yuliya Lierler - technical report - 2022
• - Yuliya Lierler - TPLP - 2022
• - Yuliya Lierler - TPLP - 2022
• - Yuliya Lierler - JELIA - 2021

• - Justin Robbins and Yuliya Lierler - JELIA - 2021
• - Nicholas Hippen and Yuliya Lierler - JELIA - 2021
• - Yuliya Lierler - TPLP - 2021
  
• - Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens, arxiv 2020
• - Pedro Cabalar, Jorge Fandinno, Yuliya Lierler - ICLP/TPLP - 2020
• - Nicholas Hippen, Yuliya Lierler - PADL - 2019
• - Yuliya Lierler - PADL - 2019
• - Yuliya Lierler - 2019
• - Da Shen, Yuliya Lierler - KR - 2018
• - Da Shen, Yuliya Lierler - ICLP - 2018
• - Yuliya Lierler - technical report - 2018

Presentations (UNO Component)

• Semantics for Conditional Literals via the SM Operator - Zach Hansen - LPNMR - 2022
• Arguing Correctness of ASP Programs with Aggregates - Zach Hansen - LPNMR - 2022
• Axiomatization of Aggregates In Answer Set Programs - Zach Hansen - AAAI - 2022
• SMT-based Constraint Answer Set Solver EZSMT - Yuliya Lierler - PADL conference, Invited talk, 2021
• Grounding Size Predictions for Answer Set Programs - Nicholas Hippen - 51ÉçÇø, MS Thesis Defense - 2019
• - Yuliya Lierler - Iowa State University Presentation - 2019
• - Yuliya Lierler -
  Invited Talk, 35th International Conference on Logic Programming - 2019
• - Brian Hodges - UNO CS Graduate Research Workshop - 2019
• - Nicholas Hippen - UNO CS Graduate Research Workshop - 2019
• - Yuliya Lierler - La Coruna University Presentation - 2019
• Automatic Program Rewriting in Non-Ground Answer Set Programs - Nicholas Hippen - PADL - 2019
• - Nicholas Hippen - MVD - 2018
• - Yuliya Lierler - MVD - 2018