Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation
원문 초록
Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks. Examples are subset-minimal model-based diagnosis, nonmonotonic reasoning by means of circumscription, or preferred extensions in abstract argumentation. Finding the optimum among many admissible solutions is often harder than finding admissible solutions with respect to both computational complexity and methodology. This paper addresses the former issue by means of an effective method for finding subset-optimal solutions. It is based on the relationship between cardinality-optimal and subset-optimal solutions, and the fact that many logic-based declarative programming systems provide constructs for finding cardinality-optimal solutions, for example maximum satisfiability (MaxSAT) or weak constraints in Answer Set Programming (ASP). Clearly each cardinality-optimal solution is also a subset-optimal one, and if the language also allows for the addition of particular restricting constructs (both MaxSAT and ASP do) then all subset-optimal solutions can be found by an iterative computation of cardinality-optimal solutions. As a showcase, the computation of preferred extensions of abstract argumentation frameworks using the proposed method is studied.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Neuro-Argumentative Learning with Case-Based Reasoning
On the Structure of Game Provenance and its Applications
A Formalisation of Abstract Argumentation in Higher-Order Logic
Deep Learning for Abstract Argumentation Semantics
MisGAN: Learning from Incomplete Data with Generative Adversarial Networks
An argumentative agent-based model of scientific inquiry
토론
이 논문과 연결된 포럼 글이 아직 없습니다.