Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.
Jorge FandinnoMarkus HecherPublished in: AAAI (2021)
Keyphrases
- space complexity
- web applications
- worst case
- search space
- upper bound
- databases
- information retrieval
- artificial intelligence
- answer set programming
- bayesian networks
- boolean functions
- computational cost
- positive and negative
- bounded treewidth
- arc consistency
- relational databases
- image segmentation
- web services
- e learning
- machine learning