Computation with run time skolemisation (N-Prolog part 3)

@article{Gabbay1993ComputationWR,
  title={Computation with run time skolemisation (N-Prolog part 3)},
  author={Dov M. Gabbay and Uwe Reyle},
  journal={J. Appl. Non Class. Logics},
  year={1993},
  volume={3},
  pages={93-128}
}
  • Dov M. Gabbay, Uwe Reyle
  • Published 1993
  • Mathematics, Computer Science
  • J. Appl. Non Class. Logics
  • ABSTRACT Two computation procedures are described for intuitionistic and classical logic. The first introduces Skolem functions at runtime. The second restricts unification by time stamping. For universal Horn clauses the computation is the same as Prolog. 

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    Interner Bericht An Intuitionistic Approach to Logic Programming

    • Rodrigo Readi-Nasser
    • 2017
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Uniform Provability in Classical Logic

    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS

    Hypothetical Reasoning with Intuitionistic Logic

    • LogicAnthony J. BonnerUniversity
    • 1994
    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Interner Bericht mj-Reduction for Proving in Predicate Logic-Extended

    • Rodrigo Readi-Nasser
    • 2017
    VIEW 2 EXCERPTS
    CITES BACKGROUND