Completeness of the SLDNF-resolution for a class of logic programs-Reference-Cited by-同舟云学术

Completeness of the SLDNF-resolution for a class of logic programs

Published:1986 Issue: Volume: Page:600-614
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Barbuti R.,Martelli M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-16492-8_109.pdf

Reference16 articles.

1. Apt, K.R., Blair, H. and Walker, A. Towards a Theory of Declarative Knowledge. IBM Internal Report, Yorktown Heights, (1985).

2. Aquilano, C., Barbuti, R., Bocchetti, P. and Martelli M. Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions. To appear in the Journal of Automated Reasoning.

3. Asirelli, P., Barbuti, R. and Levi, G. Types and Declarative Static Type Checking in Logic Programming. Proc. Programming '84, Primorsko, Bulgary, (1984).

4. Asirelli, P., De Santis, M. and Martelli M. Integrity Constraints in Logic Databases. Journal of Logic Programming 2, 3 (1985) 221–232.

5. Barbuti, R. and Martelli, M. Programming in a Generally Functional Style to Design Logic Data Bases. Internal Report of CASE Center, Syracuse University, (1986).

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

1. Symmetric structure in logic programming;Journal of Computer Science and Technology;2004-12

2. Foundations of Simplified Integrity Checking Reviewed;Database and Expert Systems Applications;1992

3. Strict completion of Logic Programs;New Generation Computing;1991-04

4. Protected completions of first-order general logic programs;Journal of Automated Reasoning;1990-06

5. A transformational approach to negation in logic programming;The Journal of Logic Programming;1990-05