Elimination of negation in a logical framework

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1862, Issue , 2000, Pages 411-426

  Momigliano, Alberto ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

CLOSED WORLD ASSUMPTION; HIGHER-ORDER; LOGICAL FRAMEWORKS; NEGATION-AS-FAILURE; NEGATIVE INFORMATION; OPEN WORLD ASSUMPTION; SPECIFICATION TOOLS; TECHNICAL IDEAS;

COMPUTER CIRCUITS;

EID: 37149045857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44622-2_28     Document Type: Article

References (19)

1. D. P. A. Brogi, P. Mancarella and F. Turini. Universal quantification by case analysis. In Proc. ECAI-90, pages 111-116, 1990.
2. K. Apt and R. Bol. Logic programming and negation. Journal of Logic Programming, 19/20:9-72, May/July 1994.
3. R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. A transformational approach to negation in logic programming. Journal of Logic Programming, 8:201-228, 1990.
4. A. Bonner. Hypothetical reasoning with intuitionistic logic. In R. Demolombe and T. Imielinski, editors, Non-Standard Queries and Answers, volume 306 of Studies in Logic and Computation, pages 187-219. Oxford University Press, 1994.
5. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322. Plenum Press, New York, 1978.
6. D. M. Gabbay. N-Prolog: An extension of Prolog with hypothetical implications II. Logical foundations and negation as failure. Journal of Logic Programming, 2(4):251-283, Dec. 1985.
7. L. Giordano and N. Olivetti. Negation as failure and embedded implication. Journal of Logic Programming, 36(2):91-147, August 1998.
8. J. Harland. On Hereditary Harrop Formulae as a Basis for Logic Programming. PhD thesis, Edinburgh, Jan. 1991.
9. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, Jan. 1993.
10. J.-L. Lassez and K. Marriot. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning, 3(3):301-318, Sept. 1987.
11. R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax: An extended abstract. In G. Winskel, editor, Proceedings of the Twelfth Annual Symposium on Logic in Computer Science, pages 434-445, Warsaw, Poland, June 1997.
12. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
13. A. Momigliano. Elimination of Negation in a Logical Framework. PhD thesis, Carnegie Mellon University, 2000. Forthcoming.
14. A. Momigliano and F. Pfenning. The relative complement problem for higher-order patterns. In D. D. Schreye, editor, Proceedings of the 1999 International Conference on Logic Programming (ICLP’99), pages 389-395, La Cruces, New Mexico, 1999. MIT Press.
15. G. Nadathur and D. Miller. An overview of λProlog. In K. A. Bowen and R. A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810-827, Seattle, Washington, Aug. 1988. MIT Press.
16. F. Pfenning. Logical frameworks. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers, 2000. In preparation.
17. T. Sato and H. Tamaki. Transformational logic program synthesis. In International Conference on Fifth Generation Computer Systems, 1984.
18. C. Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie-Mellon University, 2000. forthcoming.
19. C. Schürmann and F. Pfenning. Automated theorem proving in a simple meta-logic for LF. In C. Kirchner and H. Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction (CADE-15), pages 286-300, Lindau, Germany, July 1998. Springer-Verlag LNCS 1421.