Loop-separable programs and their first-order definability-Reference-Cited by-同舟云学术

Loop-separable programs and their first-order definability

Published:2011-03 Issue:3-4 Volume:175 Page:890-913
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Chen Yin,Lin Fangzhen,Zhang Yan,Zhou Yi

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference30 articles.

1. Datalog vs first-order logic;Ajtai;Journal of Computer and Systems Science,1994

2. V. Asuncion, F. Lin, Y. Zhang, Y. Zhou, Ordered completion for first-order logic programs on finite structures, in: Proceedings of AAAI-2010, 2010, pp. 249–254.

3. S. Chaudhuri, M.Y. Vardi, On the equivalence of recursive and nonrecursive datalog programs, in: Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on PODS, 1992, pp. 55–66.

4. Y. Chen, F. Lin, Y. Wang, M. Zhang, First-order loop formulas for normal logic programs, in: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR-2006), 2006, pp. 298–307.

5. Y. Chen, Y. Zhang, Y. Zhou, First-order indefinability of answer set programs on finite structures, in: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-2010), 2010, pp. 285–290.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Loop restricted existential rules and first-order rewritability for query answering;Journal of Logic and Computation;2021-12-23

2. A progression semantics for first-order logic programs;Artificial Intelligence;2017-09

3. Expressiveness of Logic Programs under the General Stable Model Semantics;ACM Transactions on Computational Logic;2017-06-23

4. Preferred First-Order Answer Set Programs;ACM Transactions on Computational Logic;2014-04

5. Ordered completion for first-order logic programs on finite structures;Artificial Intelligence;2012-02