See this document in CiteSeerX!

Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars  (Make Corrections)  
Paul Tarau, Veronica Dahl



  Home/Search   Context   Related

 
View or download:
irisa.fr/local/prologvis...tarau.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math.ju...ftp.irisa.fr (more)
(Enter author homepages)

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

Abstract: A set of executable specifications and efficient implementations of backtrackable state persisting over the current AND-continuation is investigated. At specification level, our primitive operations are a variant of linear and intuitionistic implications, having as consequent the current continuation. On top of them, we introduce a form of hypothetical assumptions which use no explicit quantifiers and have an easy and efficient implementation on top of logic programming systems featuring... (Update)

Similar documents (at the sentence level):
25.0%:   Backtrackable State with Linear Affine Implication .. - Paul Tarau.. (1996)   (Correct)
21.3%:   Assumption Grammars: Parsing as Hypothetical Reasoning - Veronica Dahl, Paul Tarau   (Correct)
7.2%:   Towards Logic Programming Based Coordination in Virtual.. - Tarau, Dahl, De Bosschere (1998)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Reasoning With Taxonomies - Fall (1996)   (Correct)
0.3:   Partial Translation: Towards a Portable and Efficient.. - Tarau, De Bosschere.. (1996)   (Correct)
0.2:   From Assumptions to Meaning - Dahl, Tarau   (Correct)

Similar documents based on text:   More   All
0.4:   BinProlog 4.00 User Guide - Tarau (1995)   (Correct)
0.4:   Controlling Virtual Worlds Through Extensible Natural Language - Rochefort, Dahl, Tarau (1997)   (Correct)
0.3:   A Hypothetical Reasoning Based Framework for NL Processing - Dahl, Fall, Rochefort, Tarau (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ tarau-backtrackable,
  author = "Paul Tarau and Veronica Dahl",
  title = "Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator
    Grammars",
  url = "citeseer.ist.psu.edu/343951.html" }
Citations (may not include all citations):
982   Theoretical Computer Science (context) - Girard - 1987
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
232   Linda in context (context) - Carriero, Gelernter - 1989
149   A logical analysis of modules in logic programming (context) - Miller - 1989
73   Is there a use for linear logic (context) - Wadler - 1991
63   Logic Programming in Intuitionistic Linear Logic: Theory (context) - Hodas - 1994
52   Towards a meaning of LIFE (context) - Ait-Kaci, Podelski - 1993
50   Towards a meaning of LIFE (context) - Ait-Kaci, Podelski - 1991
28   Specifying Filler-Gap Dependency Parsers in a Linear-Logic P.. - Hodas - 1992
20   Representing objects in a logic programming language with sc.. - Hodas, Miller - 1990
18   Some uses of higher-order logic in computational linguistics - Miller, Nadathur - 1986
15   Lively linear lisp--'look ma (context) - Baker - 1992
15   The architecture of an implementation of Prolog: Prolog/Mali (context) - Brisset, Ridoux - 1992
14   Backtrackable State with Linear Assumptions (context) - Tarau, Dahl et al. - 1995
12   Continuations in Prolog (context) - Brisset, Ridoux - 1993
10   Lisp and Symbolic Computation (context) - Wadler, composable - 1993
10   A useful extension to Prolog's Definite Clause Grammar notat.. (context) - Van Roy - 1989
4   Available by ftp from clement (context) - Tarau, User et al. - 1995
3   Prolog Meta-Programming with Soft Databases (context) - Tarau, Boyer - 1989
2   Natural Language Processing with Hypothetical Assumption Gra.. (context) - Fall, Tarau et al. - 1995

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.irisa.fr.html):   More
Table 51: Topology error tests - Test Path   (Correct)
Solving the Consensus Problem in a Mobile Environment - Badache, Hurfin, Macedo (1997)   (Correct)
A New Method For The Generation Of Strong Prime Numbers - Saouter (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