Elimination of Negation in a Logical Framework

  • Alberto Momigliano
Conference paper

DOI: 10.1007/3-540-44622-2_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1862)
Cite this paper as:
Momigliano A. (2000) Elimination of Negation in a Logical Framework. In: Clote P.G., Schwichtenberg H. (eds) Computer Science Logic. CSL 2000. Lecture Notes in Computer Science, vol 1862. Springer, Berlin, Heidelberg

Abstract

Logical frameworks with a logic programming interpretation such as hereditary Harrop formulae (HHF) [12] cannot express directly negative information, although negation is a useful specification tool. Since negation-as-failure does not fit well in a logical framework, especially one endowed with hypothetical and parametric judgments, we adapt the idea of elimination of negation introduced in [17] for Horn logic to a fragment of higher-order HHF. This entails finding a middle ground between the Closed World Assumption usually associated with negation and the Open World Assumption typical of logical frameworks; the main technical idea is to isolate a set of programs where static and dynamic clauses do not overlap.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Alberto Momigliano
    • 1
  1. 1.Department of PhilosophyCarnegie Mellon UniversityPittsburghUSA

Personalised recommendations