In this paper we describe the system ArgSemSAT which includes algorithms which we proved to overcome current state-of-the-art performances in enumerating preferred extensions
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
We evaluate the state of the art of solvers for hard argumentation problems—the enumeration of prefe...
International audienceArgumentation is a promising approach for defeasible reasoning. It consists of...
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumen...
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumen...
This paper presents a novel SAT-based approach for the computation of extensions in abstract argume...
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
In this paper we illustrate the design choices that led to the development of ArgSemSAT, the winner ...
Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For ...
In this paper we introduce AASExts, an algorithm for computing admissible argumentation stage extens...
In this paper we introduce AASExts, an algorithm for computing admissible argumentation stage extens...
Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For ...
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in...
Abstract. Enumerating semantics extensions in abstract argumentation is gener-ally an intractable pr...
In this paper we introduce prefMaxSAT, a solver that exploits an efficient encoding of preferred ext...
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
We evaluate the state of the art of solvers for hard argumentation problems—the enumeration of prefe...
International audienceArgumentation is a promising approach for defeasible reasoning. It consists of...
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumen...
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumen...
This paper presents a novel SAT-based approach for the computation of extensions in abstract argume...
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
In this paper we illustrate the design choices that led to the development of ArgSemSAT, the winner ...
Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For ...
In this paper we introduce AASExts, an algorithm for computing admissible argumentation stage extens...
In this paper we introduce AASExts, an algorithm for computing admissible argumentation stage extens...
Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For ...
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in...
Abstract. Enumerating semantics extensions in abstract argumentation is gener-ally an intractable pr...
In this paper we introduce prefMaxSAT, a solver that exploits an efficient encoding of preferred ext...
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
We evaluate the state of the art of solvers for hard argumentation problems—the enumeration of prefe...
International audienceArgumentation is a promising approach for defeasible reasoning. It consists of...
DOI
Add to ORKG