Pure Prolog Execution in 21 Rules

Details Pure Prolog Execution in 21 Rules Pure Prolog Execution in 21 Rules

2003-10-10

arxiv.org/abs/cs/0310020v1

Computer Science

Programming Languages

15 pages. Appeared in Proc. of the 5th Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'03), within CP'03, K

Scientific paper

A simple mathematical definition of the 4-port model for pure Prolog is
given. The model combines the intuition of ports with a compact representation
of execution state. Forward and backward derivation steps are possible. The
model satisfies a modularity claim, making it suitable for formal reasoning.

Affiliated with

Also associated with

No associations

Rating

Pure Prolog Execution in 21 Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pure Prolog Execution in 21 Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pure Prolog Execution in 21 Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216752