Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Artificial Intelligence;M. Denecker,1998
2. Lecture Notes in Artificial Intelligence;M. Denecker,2000
3. Denecker, M., Lierler, Y., Truszczynski, M., Vennekens, J.: A Tarskian semantics for Answer Set Programming (2012) (a manuscript)
4. Denecker, M., Marek, V., Truszczyński, M.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 127–144. Kluwer Academic Publishers (2000)
5. Denecker, M., Ternovska, E.: A logic for non-monotone inductive definitions. ACM Transactions on Computational Logic 9(2) (2008)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Locally Tight Programs;Theory and Practice of Logic Programming;2024-01-19
2. From Felicitous Models to Answer Set Programming;Outstanding Contributions to Logic;2023
3. Tools and Methodologies for Verifying Answer Set Programs;Electronic Proceedings in Theoretical Computer Science;2022-08-04
4. On the Foundations of Grounding in Answer Set Programming;Theory and Practice of Logic Programming;2022-07-25
5. Strong Equivalence of Logic Programs with Counting;Theory and Practice of Logic Programming;2022-06-24