18 citations · 25 across the 7 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.LO2017
Finite model reasoning over existential rules
Giovanni Amendola, Nicola Leone, Marco Manna
Ontology-based query answering (OBQA) asks whether a Boolean conjunctive query is satisfied by all models of a logical theory consisting of a relational database paired with an ont…