-
Notifications
You must be signed in to change notification settings - Fork 0
/
leaps-algorithm.html
72 lines (65 loc) · 3.01 KB
/
leaps-algorithm.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
<head>
<!-- 2022-W11-4 02:13 -->
<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1" />
<title>The LEAPS Algorithm</title>
<meta name="author" content="Inanna" />
<meta name="description" content="An introduction to the LEAPS algorithm." />
<meta name="generator" content="Org Mode" />
<link href="/site.css" rel="stylesheet" type="text/css" /><link href="images/website-icon.png" rel="icon" />
</head>
<body>
<div id="preamble" class="status">
<div><a href="/index.html"><img alt="An abstract logo representing a series of three assembly line stamping machines with the words CONS, DEV, and embalzoned in white on each machine." id="site-logo" src="/images/website-logo.png" /></a></div>
</div>
<div id="content" class="content">
<h1 class="title">The LEAPS Algorithm
<br />
<span class="subtitle">An Effective Algorithm for High Speed Computation</span>
</h1>
<div id="table-of-contents" role="doc-toc">
<h2>Table of Contents</h2>
<div id="text-table-of-contents" role="doc-toc">
<ul>
<li><a href="#orgdcb7462">Key Findings</a></li>
<li><a href="#org3b6a4fe">Background</a></li>
<li><a href="#orgd069442">Introduction</a></li>
</ul>
</div>
</div>
<div id="outline-container-orgdcb7462" class="outline-2">
<h2 id="orgdcb7462">Key Findings</h2>
<div class="outline-text-2" id="text-orgdcb7462">
<ul class="org-ul">
<li>The LEAPS algorithm is more efficient on average than the RETE algorithm, outperforming it for most tasks by a wide margin in space and time complexity as it lazily evaluates its system.</li>
<li>The algorithm is very.</li>
<li></li>
</ul>
</div>
</div>
<div id="outline-container-org3b6a4fe" class="outline-2">
<h2 id="org3b6a4fe">Background</h2>
<div class="outline-text-2" id="text-org3b6a4fe">
<dl class="org-dl">
<dt>Forward Chaining</dt><dd></dd>
<dt>Cursors</dt><dd></dd>
<dt>Pointers</dt><dd></dd>
</dl>
<p>
Because there are no good summaries of the LEAPS algorithm for popular consumption, and because it took me several days to wrap my head around the algorithm fully and obtain an implementation, I have decided to write a little blog post on the LEAPS algorithm in the BLUF format.
</p>
</div>
</div>
<div id="outline-container-orgd069442" class="outline-2">
<h2 id="orgd069442">Introduction</h2>
</div>
</div>
<div id="postamble" class="status">
<p class="date">Last Modified: 2022-W09-6 17:09</p><p class="creator">Generated Using: <a href="https://www.gnu.org/software/emacs/">Emacs</a> 27.2 (<a href="https://orgmode.org">Org</a> mode 9.4.6)</p><p class="license">Except where otherwise noted content on <a href="https://cons.dev">cons.dev</a> is licensed under a <a href="https://creativecommons.org/licenses/by-sa/4.0/" rel="license">Creative Commons Attribution-ShareAlike 4.0 International License</a>.</p>
</div>
</body>
</html>