Giovanni Amendola

A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract)

The issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP, has been relatively recently solved employing abstract solvers. In this paper we…