Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
2007.04620
Cited By

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally
Hard

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard

AAAI Conference on Artificial Intelligence (AAAI), 2020

9 July 2020

ArXiv (abs)PDF HTML

Papers citing "Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard"

4 / 4 papers shown

Rejection in Abstract Argumentation: Harder Than Acceptance?

Rejection in Abstract Argumentation: Harder Than Acceptance?European Conference on Artificial Intelligence (ECAI), 2024

Johannes Fichte

Arne Meier

124

0

0

20 Aug 2024

Characterizing Structural Hardness of Logic Programs: What makes Cycles
and Reachability Hard for Treewidth?

Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?AAAI Conference on Artificial Intelligence (AAAI), 2023

174

2

0

18 Jan 2023

Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder
than SAT after All?

Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?Artificial Intelligence (AI), 2021

207

26

0

07 Oct 2022

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic
Programs

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic ProgramsTheory and Practice of Logic Programming (TPLP), 2021

221

4

0

06 Aug 2021

Page 1 of 1