Approaching the core of unfounded sets

摘要: We elaborate upon techniques for unfounded set computations by building the concept of loops. This is driven desire to minimize redundant in solvers Answer Set Programming. begin investigating relationship between sets and loops context partial assignments. In particular, we show that subset-minimal correspond active elementary Consequentially, provide a new loop-oriented approach along with an algorithm computing sets. Unlike traditional compute greatest sets, aim at small rather let propagation (and iteration) handle reflects computation employed nomore++ system. Beyond that, identifying within can be used SATbased solvers, like assat, cmodels, or pbmodels, optimizing elimination invalid candidate models.