18 citations · 25 across the 7 of their papers we have counts for
5 papers · 1 filter
Better Paracoherent Answer Sets with Less Resources
Giovanni Amendola, Carmine Dodaro, Francesco Ricca
Answer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutio…
Abstract Solvers for Computing Cautious Consequences of ASP programs
Giovanni Amendola, Carmine Dodaro, Marco Maratea
Abstract solvers are a method to formally analyze algorithms that have been profitably used for describing, comparing and composing solving techniques in various fields such as Pro…
New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski
We propose two models of random quantified boolean formulas and their natural random disjunctive logic program counterparts. The models extend the standard models of random k-CNF f…
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…
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…