Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation

DOI10.3233/978-1-61499-672-9-966zbMath1403.68236arXiv1612.07589OpenAlexW2516814890MaRDI QIDQ4576229

Wolfgang Faber, Federico Cerutti, Mauro Vallati, Massimiliano Giacomin

Publication date: 12 July 2018

Full work available at URL: https://arxiv.org/abs/1612.07589

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Acceptance in incomplete argumentation frameworks ⋮ Paracoherent answer set computation ⋮ Design and results of the second international competition on computational models of argumentation ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained

This page was built for publication: Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation