ABSTRACT

We present ConArgLib, a C++ library implemented to help programmers solve some of the most important problems related to extension-based abstract Argumentation. The library is based on ConArg, which exploits Constraint Programming and, in particular, Gecode, a toolkit for developing constraint-based systems and applications. Given a semantics, such problems consist, for example, in enumerating all the extensions, and checking the credulous or sceptical acceptance of an argument passed as parameter. The goal is to let programmers use the library to quickly develop programs on top of it, as, for instance, implementing decision-making procedures based on the strongest arguments, or comparing two frameworks by looking at the differences between their (e.g., stable) semantics. The library features the possibility to use different branching strategies, which we all test and compare on a set of frameworks taken from the International Competition on Computational Models of Argumentation (ICCMA17). Moreover, for some of the tasks, it is possible to perform a parallel search using several workers at the same time: we test the speed-up between using from 1 to 16 threads on a set of ICCMA17 frameworks.

摘要

我们介绍了ConArgLib，这是一个 C++ 库，旨在帮助程序员解决与基于扩展的抽象论证相关的一些最重要的问题。该库基于 ConArg，它利用了约束编程尤其是 Gecode，一个用于开发基于约束的系统和应用程序的工具包。给定语义，此类问题包括，例如，枚举所有扩展，并检查作为参数传递的参数是否被轻信或怀疑接受。目标是让程序员使用该库在其基础上快速开发程序，例如，根据最有力的论据实施决策程序，或通过查看它们之间的差异（例如，稳定的）来比较两个框架语义。该库具有使用不同分支策略的可能性，我们都在一组框架上进行了测试和比较，这些框架取自国际论证计算模型竞赛( ICCMA17)）。此外，对于某些任务，可以同时使用多个 worker 执行并行搜索：我们测试了在一组 ICCMA17 框架上使用 1 到 16 个线程之间的加速。