1 citations · 4 across the 9 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 1 cited
Paradigms for Parameterized Enumeration
Nadia Creignou, Arne Meier, Julian-Steffen Müller +2
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of para…
cs.CC2013
Complexity Classifications for logic-based Argumentation
Nadia Creignou, Uwe Egly, Johannes Schmidt
We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usuall…