ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1104.2842
  4. Cited By
Augmenting Tractable Fragments of Abstract Argumentation
v1v2 (latest)

Augmenting Tractable Fragments of Abstract Argumentation

14 April 2011
S. Ordyniak
Stefan Szeider
ArXiv (abs)PDFHTML

Papers citing "Augmenting Tractable Fragments of Abstract Argumentation"

6 / 6 papers shown
Title
Computational Short Cuts in Infinite Domain Constraint Satisfaction
Computational Short Cuts in Infinite Domain Constraint Satisfaction
Peter Jonsson
Victor Lagerkvist
S. Ordyniak
55
0
0
18 Nov 2022
Backdoors into Heterogeneous Classes of SAT and CSP
Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers
Neeldhara Misra
S. Ordyniak
Stefan Szeider
Stanislav Živný
62
37
0
18 Sep 2015
Backdoors to Abduction
Backdoors to Abduction
A. Pfandler
Stefan Rümmele
Stefan Szeider
65
32
0
22 Apr 2013
The Complexity of Planning Revisited - A Parameterized Analysis
The Complexity of Planning Revisited - A Parameterized Analysis
Christer Bäckström
Yue Chen
Peter Jonsson
S. Ordyniak
Stefan Szeider
92
27
0
13 Aug 2012
Backdoors to Satisfaction
Backdoors to Satisfaction
Serge Gaspers
Stefan Szeider
90
90
0
28 Oct 2011
Backdoors to Tractable Answer-Set Programming
Backdoors to Tractable Answer-Set Programming
Johannes Fichte
Stefan Szeider
104
56
0
14 Apr 2011
1