See this document in CiteSeerX!

Towards the Automation of the Design of Logic Programming Languages (1997)  (Make Corrections)  (5 citations)
Tatjana Lutovac, James Harland



  Home/Search   Context   Related

 
View or download:
rmit.edu.au/~jah/publi...permstr.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: Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. We briefly review the main problems, which are questions that are still elusive in the design of logic programming languages, from a prooftheoretic point of view. Existing approaches and analyses which lead to the various languages are all rather sophisticated and involve complex manipulations of proofs. All are designed for... (Update)

Context of citations to this paper:   More

.... but not in the premise(s) Intuitively, the inference converts the active formulae into the principal formula (but as discussed in [13], this is sometimes too simplistic) When looking to permute the order of two inferences, it is necessary to check that the principal...

.... but not in the premise(s) Intuitively, the inference converts the active formulae into the principal formula (but as discussed in [14], this is sometimes too simplistic) When looking to permute the order of two inferences, it is necessary to check that the principal...

Cited by:   More
Proof Manipulations for Logic Programming Proof Systems - Lutovac, Harland (2001)   (Correct)
Goal-Directed Proof Search in Multiple-Conclusioned.. - Harland, Lutovac.. (2000)   (Correct)
Strategies for Logic Programming Languages - Lutovac, Harland   (Correct)

Similar documents (at the sentence level):
10.1%:   Proceedings of the CADE-14 Workshop on Strategies in.. - Gramlich, (Eds.) (1997)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Uniform Proofs and Natural Deductions - Dyckhoff, Pinto (1994)   (Correct)
0.4:   A Specification Logic for Concurrent Object-Oriented.. - Delzanno, Galmiche.. (1999)   (Correct)
0.3:   Hitch Hiker's Guide to Lygon 0.7 - Winikoff (1996)   (Correct)

Similar documents based on text:   More   All
0.2:   On Goal-Directed Proofs in Multiple-Conclusioned.. - Harland, Lutovac..   (Correct)
0.1:   Agent-Oriented Programming in Linear Logic: An Example - Abdullah-Al Amin Michael (2000)   (Correct)
0.1:   Forward and Backward Chaining in Linear Logic - Harland, Pym, Winikoff   (Correct)

Related documents from co-citation:   More   All
5:   On proof normalisation in linear logic (context) - Galmiche, Perrier - 1994
5:   A proof-theoretic analysis of goal-directed provability - Harland - 1994
5:   Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991

BibTeX entry:   (Update)

T. Lutovac and J. Harland. Towards the Automation of the Design of Logic Programming Languages. Technical Report Technical Report 97-30, Department of Computer Science, RMIT, 1997. http://citeseer.ist.psu.edu/lutovac97towards.html   More

@misc{ lutovac97towards,
  author = "T. Lutovac and J. Harland",
  title = "Towards the Automation of the Design of Logic Programming Languages",
  text = "T. Lutovac and J. Harland. Towards the Automation of the Design of Logic
    Programming Languages. Technical Report Technical Report 97-30, Department
    of Computer Science, RMIT, 1997.",
  year = "1997",
  url = "citeseer.ist.psu.edu/lutovac97towards.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1984
440   The Art of Prolog (context) - Sterling, Shapiro - 1986
343   Introduction to Metamathematics (context) - Kleene - 1952
340   Uniform proofs as a Foundation for Logic Programming (context) - Miller, Nadathur et al. - 1991
294   Isabelle - A Generic Theorem Prover (context) - Paulson - 1994
268   Proofs and Types (context) - Lafont, Taylor - 1989
257   Logic programming in a Fragment of Intuitionistic Linear Log.. - Hodas, Miller - 1994
166   An overview of Prolog (context) - Nadathur, Miller - 1988
149   A logical analysis of modules in logic programming (context) - Miller - 1989
142   Logic Programming with focusing proofs in linear logic - Andreoli - 1992
88   Linear Logic: its Syntax and Semantics - Girard - 1995
79   A Uniform Proof-theoretic Investigation of Linear Logic Prog.. - Pym, Harland - 1994
72   The theory of LEGO - a proof checker for the extended calcul.. - Pollack - 1994
63   Logic Programming in Intuitionistic Linear Logic: Theory (context) - Hodas - 1994
63   Elf: A meta-language for deductive systems (context) - Pfenning - 1994
60   Contraction-free Sequent Calculi for Intuitionistic Logic (context) - Dyckhoff - 1992
46   Forum: A multiple-conclusion specification-logic - Miller - 1996
40   Proof-nets: the Parallel syntax for Proof-theory (context) - Girard - 1995
40   volume 133 of Studies in Logic and the Foundations of Mathem.. (context) - Nederpelt, Geuvers et al. - 1994
30   Permutability of Inferences in Gentzen's Calculi LK and LJ (context) - Kleene - 1952
26   Implementing the Linear Logic Programming Language Lygon - Winikoff, Harland - 1995
26   Part I: A Tutorial on Proof Systems and Typed -Calculi (context) - Logics - 1992
25   On transforming Intuitionistic Matrix Proofs into Standard-S.. - Schmitt, Kreitz - 1995
23   Automated Proof Search in Non-classical Logic (context) - Wallen - 1990
20   A proof-theoretic Analysis of Goal-directed Provability - Harland - 1994
19   Proof Search Strategies in Linear Logic (context) - Tammet - 1994
18   Foundations of Automatic Theorem Proving (context) - for, Science - 1987
17   On Hereditary Harrop Formulae as a Basis for Logic Programmi.. (context) - Harland - 1991
16   Efficient Loop-Check for Backward Proof Search in Some Non-c.. - Heuerding, Seyfried et al. - 1996
15   On proof normalisation in Linear Logic (context) - Galmiche, Perrier - 1994
13   Part II: Linear Logic and Proof Nets (context) - Logics - 1992
12   A Logic Program for Transforming Sequent Proofs to Natural D.. - Felty - 1989
10   Expansion Tree Proofs and their Conversion to Natural Deduct.. (context) - Miller - 1984
8   Analytic and Non-analytic Proofs (context) - Pfenning - 1990
4   Canonical Proofs for Linear Logic Programming Frameworks - Galmiche - 1994
4   Pareschi Logic programming with sequent systems: A linear Lo.. (context) - Andreoli - 1989
3   Deriving Logic Programming Languages - Winikoff, Harland - 1996
2   Natural Deduction Proof Theory for Logic Programming (context) - Keronen - 1992
1   manuscript sent via linear mailing list (context) - Light - 1995
1   Cut Free Formalisation of Logic with Finitely Many Variables (context) - Gordeev - 1992
1   Proof Search in the Intuitionistic Sequent Calculi (context) - Shankar - 1992
1   A Lazy Logician's Guide to Linear Logic (context) - Davoren - 1992
1   Shankar Proof Search in First-order Linear Logic and Other C.. (context) - Lincoln - 1994
1   Pareschi Linear Objects: Logical processes with builth-in in.. (context) - Andreoli - 1991
1   Mechanising Proof Theory: Resource-Aware Logics and Proof-Tr.. (context) - Bellin - 1990
1   Lecture notes for Mathematical Logic and Logic Programming (context) - Harland - 1996

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