3 citations · 3 across the 1 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2008★ 1 cited
Logic programs with propositional connectives and aggregates
Paolo Ferraris
Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. Aggregates are an ASP construct that plays an importan…
cs.AI2003★ 3 cited
Weight Constraints as Nested Expressions
Paolo Ferraris, Vladimir Lifschitz
We compare two recent extensions of the answer set (stable model) semantics of logic programs. One of them, due to Lifschitz, Tang and Turner, allows the bodies and heads of rules…