135 citations · 319 across the 25 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LO2017
On the Computation of Paracoherent Answer Sets
Giovanni Amendola, Carmine Dodaro, Wolfgang Faber +2
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is n…
cs.AI2017★ 16 cited
Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca +1
Answer Set Programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on…