2012/02/15 by Johannes K. Fichte, Johannes Klaus Fichte, Fichte, Johannes Klaus · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.1205.3663
arxiv created 2012/02/15 · openalex publication_date 2012/02/15 · arxiv updated 2012/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Backdoors of answer-set programs are sets of atoms that represent clever reasoning shortcuts through the search space. Assignments to backdoor atoms reduce the given program to several programs that belong to a tractable target class. Previous research has considered target classes based on notions of acyclicity where various types of cycles (good and bad cycles) are excluded from graph representations of programs. We generalize the target classes by taking the parity of the number of negative edges on bad cycles into account and consider backdoors for such classes. We establish new hardness results and non-uniform polynomial-time tractability relative to directed or undirected cycles.