Comparision of abstract machines for execution of Prolog -
i'm looking research paper or other publication compare different abstract machines (more one) execution of prolog prolog interpreters not based on abstact machines. i've seen far majority of implementations seems base prolog interpreters on warren abstract machine although other abstract machines proposed (eg. vienna abstract machine, tree-oriented abstract machine) , there no general comparision. i'm interested in comparision of efficiency (not features), although compared interpreters should allow constraint-logic programming.
you can build constraint logic programming on top of ordinary prolog if introduce primitives trailed constraint store , primitives unification hooks. e.g.:
sicstus prolog: attributed variables
http://sicstus.sics.se/sicstus/docs/3.7.1/html/sicstus_17.html
jekejeke minlog: little solver
http://www.jekejeke.ch/idatab/doclet/prod/en/docs/15_min/10_docu/02_reference/04_examples/05_solver.html
http://www.jekejeke.ch/idatab/doclet/prod/en/docs/15_min/15_stdy/06_bench/10_examples/02_addensure/01_referensure.p.html
of course can view additional primitives new instructions in abstract machine. in both cases above primitives added on predicate level, begs question whether there need abstract machine constraint logic programming.
of course find couple of suggestions of constraint logic programming abstract machines through google.
bye
Comments
Post a Comment