Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann (1988)
2. Arikati, S.R., Peled, U.N.: A polynomial algorithm for the parity path problem on perfectly orientable graphs. Discrete Applied Mathematics 65(1-3), 5–20 (1996)
3. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)
4. Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and AI 15(3-4), 289–323 (1995)
5. Fichte, J.K., Szeider, S.: Backdoors to tractable answer-set programming. Extended and updated version of a paper that appeared in IJCAI 2011, CoRR abs/1104.2788 (2012)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A multiparametric view on answer set programming;Annals of Mathematics and Artificial Intelligence;2019-06-08
2. Backdoors to tractable answer set programming;Artificial Intelligence;2015-03
3. Backdoors to Satisfaction;The Multivariate Algorithmic Revolution and Beyond;2012