Alberto Momigliano, Mario Ornaghi  Home/Search
Context Related
| dsi.unimi.it/dsi/ornaghi/jlc.ps.gz dotto.usr.dsi.unimi.it/user...jlc.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: dotto.usr.dsi.unimi.it/~l...RILP (more) From: dotto.usr.dsi.unimi.it/~mobile... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The aim of this paper is to show the fruitfulness and fecundity of the proof-theoretic analysis of logic programming initiated in [33] (both for definite and normal programs). It is based on a simple logical framework that goes under the name of regular search spaces. The challenge we face here is to give a treatment in our proof-theoretic terms of the issue of negation, which has been one of the toughest problem that has plagued logic programming from its very beginning. While... (Update)
Context of citations to this paper: More
.... We give a proof theoretic analysis of logic programs transformations, viewed as operations on proof trees in the sense of [3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of...
Cited by: More
Towards a Logic for Reasoning about Logic Programs.. - Momigliano, Ornaghi (Correct)
Active bibliography (related documents): More All
0.5: Compilative Constructive Negation in Constraint Logic.. - Bruscoli, Levi, Levi, Meo (1994) (Correct)
0.5: A Clausal Form for the Completion of Logic Programs - James Harland Department (1991) (Correct)
0.5: Recovering Sequentiality in Functional-Logic Programs - Mariņo, Moreno-Navarro (Correct)
Similar documents based on text: More All
0.3: Constructive Specifications for Compositional Units - Kung-Kiu Lau Alberto (Correct)
0.2: Extracting Exact Time Bounds From Logical Proofs - Ferrari, Fiorentini, Ornaghi (Correct)
0.1: The Relation between Logic Programs and Specifications - Lau, Ornaghi (1996) (Correct)
Related documents from co-citation: More All
2: Unfoldfold transformation logic program (context) - Sato, transformation et al. - 1984
BibTeX entry: (Update)
Momigliano, A., Ornaghi, M.: Regular Search Spaces and Constructive Negation. Journal of Logic and Computation 7:3 (1997) 367--403 http://citeseer.ist.psu.edu/momigliano97regular.html More
@article{ momigliano97regular,
author = "Alberto Momigliano and Mario Ornaghi",
title = "Regular Search Spaces and Constructive Negation",
journal = "Journal of Logic and Computation",
volume = "7",
number = "3",
pages = "367--403",
year = "1997",
url = "citeseer.ist.psu.edu/momigliano97regular.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
759 Negation as Failure (context) - Clark - 1978
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
373 Constraint Logic Programming: A Survey - Lassez, Maher - 1994
340 Uniform Proofs as a Foundation for Logic Programming (context) - Miller, Nadathur et al. - 1991
186 Negation in Logic Programming (context) - Kunen - 1987
180 Logic Programming and Negation: A Survey - Apt, Bol
166 Unification Revisited (context) - Lassez, Maher et al. - 1988
166 An Overview of Prolog (context) - Nadathur, Miller - 1988
112 Constructivism in Mathematics (context) - Troesltra, van Dalen - 1988
109 Constructive Negation Based on the Completed Database (context) - Chan - 1988
82 Prolog: an Extension of Prolog with Hypothetical Implication.. (context) - Gabbay, Reyle - 1984
77 Constructive Negation for Constraint Logic Programming (context) - Stuckey - 1991
68 Negation in Logic Programming (context) - Shepherdson - 1988
56 Unification and Anti-Unification in the Calculus of Construc.. - Pfenning - 1991
49 Negation and Control in Prolog (context) - Naish - 1985
48 Disunification: A Survey - Comon - 1991
37 A Prolog Technology Theorem Prover: a New Exposition and Imp.. - Stickel - 1989
34 An Approach to Constructive Negation (context) - Drabent, Failure - 1995
30 An Extension of Constructive Negation and its Application in.. (context) - Chan - 1989
30 A Transformational Approach to Negation in Logic Programming (context) - Barbuti, Mancarella et al. - 1990
26 Negation in Rule-Based Database Languages: a Survey (context) - Bidoit - 1991
25 Explicit Representation of Terms Defined by Counter Examples (context) - Lassez, Marriot - 1987
22 Handbook of Theoretical Computer Science (context) - Apt - 1990
20 A Proof-Theory for General Unification (context) - Snyder - 1992
18 Foundations of Automatic Theorem Proving (context) - Gallier, Computer - 1987
18 Transformational Logic Program Synthesis (context) - Sato, Tamaki - 1984
17 On Hereditary Harrop Formulae as a Basis for Logic Programmi.. (context) - Harland - 1991
15 Negation as Inconsistency (context) - Gabbay, Sergot - 1986
15 A Sound and Complete Semantics for a Version of Negation as .. (context) - Shepherdson - 1989
14 Almqvist and Wiksell (context) - Prawitz - 1965
14 A Comparison of three Prolog Extensions (context) - Reed, Loveland - 1992
9 Complete Logic Programs with Domain Closure Axiom (context) - Mancarella, Martini et al. - 1988
9 Negation as Failure (context) - Shepherdson - 1985
8 Intensional Negation of Logic Programs (context) - Barbuti, Mancarella et al. - 1987
8 Deduced Relevant Types and Constructive Negation (context) - Foo, Rao et al. - 1988
6 Elimination of Negation in Term Algebras - Lassez, Maher et al. - 1991
6 The Proof-Theory of Logic Programs with Negation (context) - Stark - 1992
4 Intensional Negation in Constraint Logic Programming - Bruscoli, Levi et al. - 1993
4 Reynolds and Heyting Models of Logic Programs (context) - Kemp, Ringwood - 1994
3 The decision problem for a class of first-order formulas in .. (context) - Krom - 1967
3 A Clausal Form of the Completion of Logic Programs - Harland - 1991
3 Regular Search Spaces as a Foundation of Logic Programming (context) - Momigliano, Ornaghi - 1994
2 Extending Constructive Negation for Partial Functions in Laz.. (context) - Navarro - 1996
1 Foundations of Disjunctive Logic Programs (context) - Rajasekar, Minker et al. - 1992
1 Universita' di Pisa (context) - Levi, Universal et al. - 1992
1 Some Applications of Cut-Elimination (context) - Schwitchtenberg - 1977
1 On Constructive Negation in Disjunctive Databases (context) - Lobo - 1990
1 Fail Substitutions for Negation as Failure (context) - Maluzinski, Naslund - 1989
1 A Logical Programming Language with Lambda-Abstraction (context) - Miller - 1991
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