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. 2402.03539
  4. Cited By
Extended Version of: On the Structural Hardness of Answer Set
  Programming: Can Structure Efficiently Confine the Power of Disjunctions?

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?

5 February 2024
Markus Hecher
Rafael Kiesel
ArXiv (abs)PDFHTML

Papers citing "Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?"

Title
No papers