I'm looking for research paper or any other publication that compare different abstract machines (more than one) for execution of Prolog with prolog interpreters not based on abstact machines. What I've seen so far is that majority of implementations seems to base their prolog interpreters on Warren Abstract Machine although other abstract machines were proposed (eg. Vienna Abstract Machine, Tree-Oriented Abstract Machine) and there is no any general comparision. I'm interested in comparision of efficiency (not features), although all compared interpreters should allow for constraint-logic programming.
Comparision of abstract machines for execution of Prolog
539 Views Asked by Grzegorz Adam Kowalski At
1
There are 1 best solutions below
Related Questions in PROLOG
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
- gprolog: Getting a stacktrace after an exception
- Prolog- Returning elements from facts
- run a prolog code with swipl in a command line
- Prolog- singleton variable in branch warning
- Prolog-iterating through list
Related Questions in ABSTRACT-MACHINE
- How is code stored and executed on the C++ abstract machine?
- Parse an Expression to its components and sub components
- C11/C++11 memory model acquire, release, relaxed specifics
- What is a Abstract Machine?
- Result of sizeof for C++ arrays and pointers
- generate abstract machine code from simple programming instructions
- How can Turing machine compare to a computer?
- Is there a free Warren Abstract Machine implementation for Delphi?
- What is C++ abstract machine
- Abstract machine for Java bytecode
- Comparision of abstract machines for execution of Prolog
- In the SECD Machine how does "rap" work?
Related Questions in WARREN-ABSTRACT-MACHINE
- Does WAM Prolog have a Symbol Table?
- In a Warren's Abstract Machine, where are Argument Variables created?
- GNU Prolog: Displaying WAM code for query?
- How can I inspect WAM code in SICStus Prolog
- Show WAM code for a given Prolog program
- Alternatives to the WAM
- When Warren's Abstract Machine program instructions are executed?
- How code generation works for Ait-Kaci's WAM L1?
- Which is the correct order to generate WAM code for L0 program terms?
- Comparision of abstract machines for execution of Prolog
- In a Warren's Abstract Machine, how does bind work, if one of the arguments is a register?
- simulator for abm-machine instructions (Getting wrong output)
- Does Prolog need GC when the occurs check is globally enabled?
- Flattened form in WAM
- WAM register allocation for same structures
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
You can build constraint logic programming on top of ordinary prolog if you introduce some primitives for a trailed constraint store and some primitives for 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 you can view the additional primitives as new instructions in the abstract machine. But in both cases above the primitives are added on the predicate level, so that it begs the question whether there is really a need for an abstract machine for constraint logic programming.
Of course you will find a couple of suggestions of constraint logic programming abstract machines as well through google.
Bye