See this document in CiteSeerX!

On Goal-Directed Provability in Classical Logic (1994)  (Make Corrections)  (7 citations)
James Harland
International Logic Programming Symposium



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
rmit.edu.au/~jah/public...iclp94a.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rmit.edu.au/~jah/pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper we explore the possibilities for a notion of goal-directed proof in classical logic. The technical point to consider is how to deal with the multipleconclusioned nature of classical sequents, i.e. that classical succedents may contain more than one formula. This means that there may be more than one "candidate" right rule, as there may be several non-atomic formulae in the succedent, and so a choice has to be made as to which formula is to be reduced in the next step. The question of ... (Update)

Context of citations to this paper:   More

.... of notions of goaldirected provability for multiple conclusioned systems such as linear logic [1, 10, 19] and classical logic [8, 17, 18]. Thus it seems appropriate to investigate the design of logic programming languages via goal directed provability for a multiple...

.... of notions of goal directed provability for multiple conclusioned systems such as linear logic [1, 15, 19, 21] and classical logic [10, 18]. Thus it seems appropriate to investigate the design of logic programming languages via goal directed provability for a multiple...

Cited by:   More
Disjunction and Modular Goal-directed Proof Search - Stone   (Correct)
Proof Manipulations for Logic Programming Proof Systems - Lutovac, Harland (2001)   (Correct)
Goal-Directed Proof Search in Multiple-Conclusioned.. - Harland, Lutovac.. (2000)   (Correct)

Similar documents (at the sentence level):
40.2%:   On Goal-Directed Provability in Classical Logic - Harland (1992)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Tractable Reasoning in Knowledge Representation Systems - Dalal (1995)   (Correct)
0.1:   Proof Search Issues In Some Non-Classical Logics - Howe (1998)   (Correct)
0.1:   Towards a Sequent Calculus for Negation as Failure - Harland   (Correct)

Similar documents based on text:   More   All
0.3:   Correspondences between Classical, Intuitionistic and Uniform.. - Nadathur   (Correct)
0.3:   On Goal-Directed Proofs in Multiple-Conclusioned.. - Harland, Lutovac..   (Correct)
0.2:   A Modal Analysis of some Principles of the Provability Logic of.. - Iemhoff (1998)   (Correct)

Related documents from co-citation:   More   All
8:   Logic programming in a fragment of intuitionistic linear logic - Hodas, Miller - 1994
7:   Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
6:   Logic programming with focusing proofs in linear logic - Andreoli - 1992

BibTeX entry:   (Update)

J. Harland and D. Pym. On Goal-directed Provability in Classical Logic. Technical report 92/16, Dept. of Computer Science, Univ. of Melbourne, 1992. http://citeseer.ist.psu.edu/harland94goaldirected.html   More

@inproceedings{ harland93goaldirected,
    author = "James Harland",
    title = "On Goal-Directed Provability in Classical Logic",
    booktitle = "International Logic Programming Symposium",
    pages = "677",
    year = "1993",
    url = "citeseer.ist.psu.edu/harland94goaldirected.html" }
Citations (may not include all citations):
340   Uniform Proofs as a Foundation for Logic Programming (context) - Miller, Nadathur et al. - 1991  ACM   DBLP
149   A Logical Analysis of Modules in Logic Programming (context) - Miller - 1989  ACM   DBLP
79   A Uniform Proof-Theoretic Investigation of Linear Logic Prog.. - Harland, Pym - 1994  DBLP
49   A Fixpoint Semantics for Disjunctive Logic Programs (context) - Minker, Rajasekar - 1990  ACM   DBLP
30   Permutability of inferences in Gentzen's calculi LK and LJ (context) - Kleene - 1952
26   Proof Search in First-order Linear Logic and Other Cutfree S.. - Lincoln, Shankar - 1994
20   A Proof-Theoretic Analysis of Goal-Directed Provability - Harland  DBLP
11   The permutability of rules in the classical inferential calc.. (context) - Curry - 1952  DBLP
7   Herbrand Methods in Linear Logic (context) - Cerrito - 1992
2   personal communication (context) - McCarty - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.rmit.edu.au/~jah/pubs.html):   More
Structural Properties of Logic Programs - Harland   (Correct)
A Kripke-like Model for Negation as Failure - Harland (1989)   (Correct)
Some Issues in the Operational Semantics of Logic Programs (or.. - Harland (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