________________________________________________________________________

This file is part of Logtalk <http://logtalk.org/>  

Logtalk is free software. You can redistribute it and/or modify it under
the terms of the FSF GNU General Public License 3  (plus some additional
terms per section 7).        Consult the `LICENSE.txt` file for details.
________________________________________________________________________


To load this example and for sample queries, please see the `SCRIPT.txt`
file.

This example provides a simple, limited, implementation of ground linear
and intuitionistic assumptions as discussed in the following paper:

	@inproceedings{DBLP:conf/slp/TarauDF95,
	  author    = {Paul Tarau and
	               Ver{\'o}nica Dahl and
	               Andrew Fall},
	  title     = {Backtrackable State with Linear Assumptions, Continuations
	               and Hidden Accumulator Grammars},
	  booktitle = {ILPS},
	  year      = {1995},
	  pages     = {642},
	  crossref  = {DBLP:conf/slp/1995},
	  bibsource = {DBLP, http://dblp.uni-trier.de}
	}
	@proceedings{DBLP:conf/slp/1995,
	  editor    = {John W. Lloyd},
	  title     = {Logic Programming, Proceedings of the 1995 International
	               Symposium, Portland, Oregon, USA, December 4-7, 1995},
	  booktitle = {ILPS},
	  publisher = {MIT Press},
	  year      = {1995},
	  isbn      = {0-262-62099-5},
	  bibsource = {DBLP, http://dblp.uni-trier.de}
	}

A web version of this paper is also available at:

	http://www.cse.unt.edu/~tarau/research/PapersHTML/state.html
