Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...