Homepage of Marija Kulas
'04
Welcome / Willkommen / Dobrodosli !

 
[7] M. Kulas. A practical view on substitutions. Technical report IB 372-07/2016, FernUniversität in Hagen, 2016.  Available as pdf.
A concept of prenaming, which formalizes the intuitive practice of renaming terms and allows for extensibility. A simple algorithm for term matching, which also decides substitution generality using witness term.
[6] M. Kulas. Toward the concept of backtracking computation.   In  Proc. of the Workshop on Structural Operational Semantics (SOS'04), August 2004, London. Editors L. Aceto, W. Fokkink and I. Ulidowski. Electronic Notes in Theoretical Computer Science, Volume 128, Issue 1. Elsevier, 2005.  Available via Elsevier link, also here as pdf.
A new mathematical model S1:PP of pure Prolog execution is proposed. S1:PP is a modification of our previous model S:PP [5], resulting in a more manageable data flow. Feature: aggregation of transition steps.
[5] M. Kulas. Pure Prolog Execution in 21 Rules.   In  Proc. of the 5th Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'03), September 2003, Kinsale.  Available as pdf or gzip'ped postscript, also in arxiv.
A simple mathematical definition S:PP of the four-port metaphor of Prolog execution is given. Features: forward and backward derivation steps, modularity.
[4] M. Kulas and C. Beierle. Defining Standard Prolog in Rewriting Logic.   In  Proc. of the 3rd Int. Workshop on Rewriting Logic and its Applications (WRLA'2000), September 2000, Kanazawa. Editor K. Futatsugi. Electronic Notes in Theoretical Computer Science, Volume 36. Elsevier, 2001.  http://www.elsevier.nl/locate/entcs/volume36.html, also here as pdf.
The second report on the simple operational semantics of Standard Prolog introduced in [3].
[3] M. Kulas. A Rewriting Prolog Semantics.   In  Proc. of the CL'2000 Workshop on Verification and Computational Logic (VCL'2000), July 2000, London. Editors M. Leuschel, A. Podelski, C.R. Ramakrishnan and U. Ultes-Nitsche. Southampton University Tech. Report DSSE-TR-2000-6,  http://www.ecs.soton.ac.uk/~mal/vcl2000.html, also here as gzip'ped postscript.
A lean operational semantics of a characteristic subset of Standard Prolog (the whole logic and control, database updates and solution collecting) is proposed. Feature: suffix criterion, enabling simple treatment of cut and catch/throw.
[2] M. Kulas. Debugging Prolog using Annotations.   In  Proc. of the 10th Workshop on Logic Programming Environments (WLPE'99), Las Cruces, NM. Editors M. Ducasse, A. Kusalik and G. Puebla. Electronic Notes in Theoretical Computer Science, Volume 30, Issue 4. Elsevier, 2000.  http://www.elsevier.nl/locate/entcs/volume30.html, also here as gzip'ped postscript.
The second report on the annotation language introduced in [1]. Feature: annotations act as executable comments, performing debugging at run-time.
[1] M. Kulas. Annotations for Prolog - A Concept and Runtime Handling.   In  A. Bossi, editor, Logic-Based Program Synthesis and Transformation. Selected Papers of the 9th International Workshop (LOPSTR'99), Venezia, LNCS 1817, pages 234-254. Springer-Verlag, 2000.  http://www.springer.de/comp/lncs/, also here with un-crippled fonts: gzip'ped postscript.
A concept of annotations for rendering procedural aspects of Prolog is introduced, superseding pre/post conditions as well as program-point assertions. Features: calling template and context, soft success (wrt invariant), parametricity.

[ my BibTeX references] [ how to reach me] [ World clock] [ German universities] [ PI8]

This is http://www.fernuni-hagen.de/pi8/mk, updated on July 4, 2016 by Marija.