Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
Many researchers have observed that neurons process information in an imprecise manner - if a logical inference emerges from neural computation, it is inexact at best. Thus, there...