Intensional negation of logic programs: Examples and implementation techniques-Reference-Cited by-同舟云学术

Intensional negation of logic programs: Examples and implementation techniques

Published: Issue: Volume: Page:96-110
ISSN:
Container-title:TAPSOFT '87
language:
Short-container-title:

Author:

Barbuti Roberto,Mancarella Paolo,Pedreschi Dino,Turini Franco

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0014975

Reference20 articles.

1. Ambriola,V., Giannotti,F., Pedreschi,D., Turini,F. “Symbolic Semantics Semantics and Program Reduction”. IEEE Trans. on Soft. Eng. SE-11,8 (Aug.85) 784–794.

2. Apt, K.R., Van Emden M.H. “Contribution to the Theory of Logic Programming”. J.ACM, 29, 3, (1982) 841–862.

3. Aquilano, C., Barbuti, R., Bocchetti, P., Martelli, M. “Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions”. Journal of Automated Reasoning, 2 (1986) 155–170.

4. Barbuti,R., Mancarella,P., Pedreschi,D., Turini,F. “Intensional Negation of Logic Programs”. submitted for publication to the Journal of Logic Programming (1986).

5. Barbuti, R., Martelli, M. “Completeness of the SLDNF-Resolution for a Class of Logic Programs”. Proc. of 3rd Int. Conf. on Logic Programming, London, July 14–18 (1986).

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

1. The undecidability of proof search when equality is a logical connective;Annals of Mathematics and Artificial Intelligence;2021-07-03

2. Soundness and Completeness of an “Efficient” Negation for Prolog;Logics in Artificial Intelligence;2004

3. Implementation Results in Classical Constructive Negation;Logic Programming;2004

4. Constructive Intensional Negation;Functional and Logic Programming;2004

5. Extending constructive negation for partial functions in lazy functional-logic languages;Extensions of Logic Programming;1996