What Is Answer Set Programming To Propositional Satisfiability, Yuliya Lierler
Nov 2016
What Is Answer Set Programming To Propositional Satisfiability, Yuliya Lierler
Yuliya Lierler
Propositional satisfiability (or satisfiability) and answer set programming are two closely related subareas of Artificial Intelligence that are used to model and solve difficult combinatorial search problems. Satisfiability solvers and answer set solvers are the software systems that find satisfying interpretations and answer sets for given propositional formulas and logic programs, respectively. These systems are closely related in their common design patterns. In satisfiability, a propositional formula is used to encode problem specifications in a way that its satisfying interpretations correspond to the solutions of the problem. To find solutions to a problem it is then sufficient to use a …
Constraint Cnf: A Sat And Csp Language Under One Roof, Broes De Cat, Yuliya Lierler
Sep 2016
Constraint Cnf: A Sat And Csp Language Under One Roof, Broes De Cat, Yuliya Lierler
Yuliya Lierler
A new language, called constraint CNF, is proposed. It integrates propositional logic with constraints stemming from constraint programming (CP). A family of algorithms is designed to solve problems expressed in constraint CNF. These algorithms build on techniques from both propositional satisfiability (SAT) and CP. The result is a uniform language and an algorithmic framework, which allow us to gain a deeper understanding of the relation between the solving techniques used in SAT and in CP and apply them together.
Constraint Answer Set Programming Versus Satisfiability Modulo Theories, Yuliya Lierler, Benjamin Susman
Jun 2016
Constraint Answer Set Programming Versus Satisfiability Modulo Theories, Yuliya Lierler, Benjamin Susman
Yuliya Lierler
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. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we make the link between these two areas precise.
Iclp Tutorial: Relating Constraint Answer Set Programming And Satisfiability Modulo Theories, Yuliya Lierler
Dec 2015
Iclp Tutorial: Relating Constraint Answer Set Programming And Satisfiability Modulo Theories, Yuliya Lierler
Yuliya Lierler
No abstract provided.
Syllabus: Csci2030: Mathematical Foundations Of Computer Science, Yuliya Lierler
Dec 2015
Syllabus: Csci2030: Mathematical Foundations Of Computer Science, Yuliya Lierler
Yuliya Lierler
No abstract provided.
Systems, Engineering Environments, And Competitions, Yuliya Lierler, Marco Maratea, Francesco Ricca
Dec 2015
Systems, Engineering Environments, And Competitions, Yuliya Lierler, Marco Maratea, Francesco Ricca
Yuliya Lierler
The goal of this paper is threefold. First, we trace the history of the development of answer set solvers, by accounting for more than a dozen of them. Second, we discuss development tools and environments that facilitate the use of answer set programming technology in practical applications. Last, we present the evolution of the answer set programming competitions, prime venues for tracking advances in answer set solving technology.
Elements Of Discrete Mathematics, Yuliya Lierler
Dec 2015
Elements Of Discrete Mathematics, Yuliya Lierler
Yuliya Lierler
No abstract provided.
