Alberto Momigliano  Home/Search
Context Related
| mcs.le.ac.uk/~amomigliano/p...csl.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mcs.le.ac.uk/~amomigliano/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Logical frameworks with a logic programming interpretation such as hereditary Harrop formulae (HHF) [15] cannot express directly negative information, although negation is a useful speci cation tool. Since negation-as-failure does not t well in a logical framework, especially one endowed with hypothetical and parametric judgements, we adapt the idea of elimination of negation introduced in [21] for Horn logic to a fragment of higher-order HHF. This entails nding a middle ground between... (Update)
Context of citations to this paper: More
...answers to negative queries. Our main motivation has been the explicit synthesis of the negation of higher order logic programs [Momigliano 2000a; 2000b] as discussed brie y in Section 9. Lassez and Marriot [1987] proposed the seminal uncover algorithm for computing rst order...
...amomigliano mcs.le. ac.uk This is a detailed version of the main example in the companion paper [1]. Consider the language of the untyped calculus 1 : e : x j x : e j e 1 e 2 A term is linear if every functional sub term uses each of its arguments exactly once: in...
Cited by: More
Elimination of Negation in a Logical Framework - Momigliano (Correct)
A Step-to-Step Example of Negation Elimination in Hereditary.. - Momigliano (Correct)
Higher-Order Pattern Complement and the Strict ...-Calculus - Momigliano, Pfenning (Correct)
Active bibliography (related documents): More All
0.3: Recursion for Higher-Order Encodings - Schürmann (Correct)
0.3: A Type-Theoretic Approach to Induction with Higher-Order Encodings - Schürmann (2001) (Correct)
0.3: Bibliography for An Algebraic Study of Modularity in Logic.. - Pino (1999) (Correct)
Similar documents based on text: More All
0.4: The Practice of Logical Frameworks - Frank Pfenning (1996) (Correct)
0.3: A Clausal Form for the Completion of Logic Programs - James Harland Department (1991) (Correct)
0.3: Logical Frameworks - Pfenning (2001) (Correct)
Related documents from co-citation: More All
7: A transformational approach to negation in logic programming (context) - Barbuti, Mancarella et al. - 1990
5: Reduction types and intensionality in the lambda-calculus (context) - Wright - 1992
5: A logic programming language with lambda-abstraction - Miller - 1991
BibTeX entry: (Update)
Alberto Momigliano. Elimination of negation in a logical framework. PhD thesis, Carnegie Mellon University, Forthcoming. http://citeseer.ist.psu.edu/482102.html More
@inproceedings{ momigliano00elimination,
author = "Alberto Momigliano",
title = "Elimination of Negation in a Logical Framework",
booktitle = "{CSL}",
pages = "411-426",
year = "2000",
url = "citeseer.ist.psu.edu/482102.html" }
Citations (may not include all citations):759 Negation as failure (context) - Clark - 1978 ACM DBLP
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller ACM DBLP
90 A linear logical framework - Cervesato, Pfenning - 1996 ACM DBLP
82 Prolog: An extension of Prolog with hypothetical implication.. (context) - Gabbay - 1985
51 A framework for dening logics (context) - Harper, Honsell et al. - 1993
48 A logic for reasoning with higher-order abstract syntax: An .. (context) - McDowell, Miller - 1997
47 Logical frameworks - Pfenning - 2000 ACM DBLP
30 A transformational approach to negation in logic programming (context) - Barbuti, Mancarella et al. - 1990 ACM DBLP
20 Automating the Meta-Theory of Deductive Systems - Sch - 2000
18 Transformational logic program synthesis (context) - Sato, Tamaki - 1984 DBLP
17 On Hereditary Harrop Formulae as a Basis for Logic Programmi.. (context) - Harland - 1991
12 Elimination of Negation in a Logical Framework - Momigliano - 2000 ACM DBLP
10 Compilative constructive negation in constraint logic progra.. - Bruscoli, Levi et al. - 1994 ACM DBLP
7 Automated theorem proving in a simple meta-logic for LF (context) - Sch, Pfenning - 1998 ACM DBLP
7 Explicit representation of terms dened by counter examples (context) - Lassez, Marriot - 1987
5 Hypothetical reasoning with intuitionistic logic - Bonner - 1994 ACM
4 Rules of denitional re ection (context) - Schroeder-Heister - 1993
3 The relative complement problem for higher-order patterns - Momigliano, Pfenning ACM DBLP
3 Logic programming and negation (context) - Apt, Bol - 1994
2 Universal quantication by case analysis (context) - Brogi, Mancarella et al. - 1990
2 Negation as failure and embedded implication (context) - Giordano, Olivetti - 1998
1 Minimal negation and hereditary Harrop formulae (context) - Momigliano - 1992 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mcs.le.ac.uk/~amomigliano/): More
A Step-to-Step Example of Negation Elimination in Hereditary.. - Momigliano (Correct)
Higher-Order Pattern Complement and the Strict ...-Calculus - Momigliano, Pfenning (Correct)
Towards a Logic for Reasoning about Logic Programs.. - Momigliano, Ornaghi (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC