3 citations · 3 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2010
A decidable subclass of finitary programs
Sabrina Baselice, Piero A. Bonatti
Answer set programming - the most popular problem solving paradigm based on logic programs - has been recently extended to support uninterpreted function symbols. All of these appr…
cs.AI2009★ 3 cited
On finitely recursive programs
Sabrina Baselice, Piero A. Bonatti, Giovanni Criscuolo
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground…