Ordered completion for first-order logic programs on finite structures-Reference-Cited by-同舟云学术

Ordered completion for first-order logic programs on finite structures

Published:2012-02 Issue: Volume:177-179 Page:1-24
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Asuncion Vernon,Lin Fangzhen,Zhang Yan,Zhou Yi

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference27 articles.

1. Propositional semantics for disjunctive logic programs;Rachel;Annals of Mathematics and Artificial Intelligence,1994

2. Yin Chen, Fangzhen Lin, Yisong Wang, Mingyi Zhang, First-order loop formulas for normal logic programs, in: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KRʼ06), 2006, pp. 298–307.

3. Loop-separable programs and their first-order definability;Chen;Artificial Intelligence,2011

4. Negation as failure;Clark,1978

5. Finite Model Theory;Ebbinghaus,1995

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

1. First-order ASP programs as CHR programs;Proceedings of the 36th Annual ACM Symposium on Applied Computing;2021-03-22

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

3. Reasoning About Policies in Security-Aware Service Discovery Using Answer Set Programming;International Journal of Cooperative Information Systems;2016-03

4. Knowledge compilation of logic programs using approximation fixpoint theory;Theory and Practice of Logic Programming;2015-07

5. Fuzzy answer set computation via satisfiability modulo theories;Theory and Practice of Logic Programming;2015-07