CEGARTIX: A SAT-Based Argumentation System

Abstract

CEGARTIX is a system for solving decision problems beyond NP in the domain of abstract argumentation. The system implements multiple counterexample guided abstraction refinement (CEGAR) algorithms in which Boolean satisfiability (SAT) solvers play a central role as the core NP-solvers. The performance of CEGARTIX is comparable and in cases superior to… (More)

Topics

2 Figures and Tables

Slides referencing similar topics