James Harland, Tatjana Lutovac, Michael Winikoff  Home/Search
Context Related
| cs.mu.oz.au/~winikoff/Paper...cl2000.ps 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: cs.mu.oz.au/~winikoff/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A key property in the definition of logic programming languages is the completeness of goal-directed proofs. This concept originated in the study of logic programming languages for intuitionistic logic in the (single-conclusioned) sequent calculus LJ, but has subsequently been adapted to multiple-conclusioned systems such as those for linear logic. Given these developments, it seems interesting to investigate the notion of goal-directed proofs for a multiple-conclusioned sequent... (Update)
Context of citations to this paper: More
.... calculus LJ and the multiple conclusioned calculus, which, following Ritter, Pym and Wallen [10] we refer to as LM [11, 12] In [6] it is noted how LM can be considered as better for search than LJ, due to the greater possibilities for delaying choices (particularly...
.... conclusioned systems for the same logic (such as LJ and LM for intuitionistic logic) can lead to different logic programming languages [9]. Thus when seeking to extend such an analysis to a new logic, it is important to be able to isolate the critical properties of the set of...
Cited by: More
Disjunction and Modular Goal-directed Proof Search - Stone (Correct)
Proof Manipulations for Logic Programming Proof Systems - Lutovac, Harland (2001) (Correct)
An Algebraic Approach to Proof Search in Sequent Calculi - Harland (2001) (Correct)
Similar documents (at the sentence level):
32.2%: On Goal-Directed Proofs in Multiple-Conclusioned.. - Harland, Lutovac.. (Correct)
Active bibliography (related documents): More All
1.7: Goal-Directed Proof Search in Multiple-Conclusioned.. - Harland, Lutovac.. (2000) (Correct)
0.3: Strategies for Logic Programming Languages - Lutovac, Harland (Correct)
0.2: Agent-Oriented Programming in Linear Logic - Amin (1999) (Correct)
Similar documents based on text: More All
0.4: Agent Negotiation as Proof Search in Linear Logic - Harland, Winikoff (2002) (Correct)
0.3: Programming in Lygon: An Overview - Harland, Pym, Winikoff (1996) (Correct)
0.2: What is Logic Programming? Michael Winikoff 7/10/94 1 - Logic Programming Proof (Correct)
Related documents from co-citation: More All
3: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
2: Miller D.: A Logical Analysis of Modules in Logic Programming, Journal of Logic Programming, 1989, pp. 79 19
2: Logic programming in a fragment of intuitionistic linear logic - Hodas, Miller - 1994
BibTeX entry: (Update)
J. Harland, T. Lutovac, M. Winikoff, Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic, Proceedings of the First International Conference on Computational Logic 254-268, London, July, 2000. http://citeseer.ist.psu.edu/article/harland00goaldirected.html More
@article{ harland00goaldirected,
author = "James Harland and Tatjana Lutovac and Michael Winikoff",
title = "Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic",
journal = "Lecture Notes in Computer Science",
volume = "1861",
pages = "254--??",
year = "2000",
url = "citeseer.ist.psu.edu/article/harland00goaldirected.html" }
Citations (may not include all citations):759 Negation as Failure (context) - Clark - 1978
340 Uniform Proofs as a Foundation for Logic Programming (context) - Miller, Nadathur et al. - 1991
257 Logic Programming in a Fragment of Intuitionistic Linear Log.. - Hodas, Miller - 1994
223 Linear Objects: Logical Processes with Built-in Inheritance - Andreoli, Pareschi - 1990
142 Logic Programming with Focusing Proofs in Linear Logic - Andreoli - 1992
97 Automated Deduction in Nonclassical Logics (context) - Wallen - 1990
79 A Uniform Proof-theoretic Investigation of Linear Logic Prog.. - Pym, Harland - 1994
60 Contraction-free Sequent Calculi for Intuitionistic Logic (context) - Dyckhoff - 1992
49 A Fixpoint Semantics for Disjunctive Logic Programs (context) - Minker, Rajasekar - 1990
47 Untersuchungen uber das logische Schliessen (context) - Gentzen - 1934
46 Programming in Lygon: An Overview - Harland, Pym et al. - 1996
46 Forum: A Multiple-Conclusion Specification Logic - Miller - 1996
20 A Proof-Theoretic Analysis of Goal-Directed Provability - Harland - 1994
15 On Proof Normalisation in Linear Logic (context) - Galmiche, Perrier - 1994
12 Concurrent Logic Programming as Uniform Linear Proofs - Volpe - 1994
9 Uniform Provability in Classical Logic - Nadathur - 1998
8 On Normal Forms and Equivalence for Logic Programs - Harland - 1992
8 ACL - A Concurrent Linear Logic Programming Paradigm (context) - Kobayash, Yonezawa - 1993
7 On Goal-Directed Provability in Classical Logic - Harland - 1997
6 Logic Programming with Linear Logic - Winikoff - 1997
5 A Deterministic Terminating Sequent Calculus for Godel-Dumme.. - Dyckhoff - 1999
5 Towards the Automation of the Design of Logic Programming La.. - Lutovac, Harland - 1997
3 to appear in Theoretical Computer Science (context) - Ritter, Pym et al. - 1999
Documents on the same site (http://www.cs.mu.oz.au/~winikoff/pubs.html): More
Animating Z Using Logic Programming Techniques - Winikoff, Dart, Kazmierczak (1998) (Correct)
Logic Programming with Linear Logic - Winikoff (1997) (Correct)
Programming in Lygon: An Overview - Harland, Pym, Winikoff (1995) (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