102 lines
3.0 KiB
HTML
102 lines
3.0 KiB
HTML
<html>
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html;charset=utf-8">
|
|
|
|
<title>YAP Prolog</title>
|
|
|
|
<link rel="stylesheet" type="text/css" charset="utf-8" media="all" href="balanced2/css/common.css">
|
|
<link rel="stylesheet" type="text/css" charset="utf-8" media="screen" href="balanced2/css/screen.css">
|
|
<link rel="stylesheet" type="text/css" charset="utf-8" media="print" href="balanced2/css/print.css">
|
|
<link rel="stylesheet" type="text/css" charset="utf-8" media="projection" href="balanced2/css/projection.css">
|
|
|
|
<style type="text/css">
|
|
.style3 {
|
|
text-align: justify;
|
|
}
|
|
</style>
|
|
|
|
</head>
|
|
|
|
<body><!-- lang="en" dir="ltr"> -->
|
|
<div id="mastwrap">
|
|
|
|
<div id="masthead">
|
|
<a class="imageLink"> </a>
|
|
|
|
<div id="sisternav">
|
|
<ul>
|
|
<li id="plain">
|
|
<a href="index.html">Main</a>
|
|
</li>
|
|
<li id="plain">
|
|
<a href="downloads.html">Downloads</a>
|
|
</li>
|
|
<li id="plain">
|
|
<a href="documentation.html">Documentation</a>
|
|
</li>
|
|
<li id="plain">
|
|
<a href="packages.html">Packages</a>
|
|
</li>
|
|
<li id="current">
|
|
<a href="applications.html">Applications</a>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
|
|
</div> <!-- of masthead -->
|
|
</div> <!-- of mastwrap -->
|
|
|
|
|
|
<a id="top"></a>
|
|
|
|
<blockquote>
|
|
<h2>:- Applications</h2>
|
|
<p class="style3">
|
|
|
|
This is a list of some applications and contributions to YAP:
|
|
|
|
<ul>
|
|
<li>
|
|
<p class="style3"> <A
|
|
HREF="http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/aleph_toc.html">Aleph
|
|
A Learning Engine for Proposing Hypotheses</A></p>
|
|
<p class="style3">
|
|
|
|
Aleph is an Inductive Logic Programming (ILP) system that supersedes P-Progol.
|
|
|
|
<li>
|
|
<p class="style3"> <A HREF="http://www.let.rug.nl/~vannoord/Fsa/">FSA Utilities Toolbox</A></p>
|
|
<p class="style3">
|
|
|
|
The FSA Utilities toolbox is a collection of utilities to manipulate
|
|
regular expressions, finite-state automata and finite-state
|
|
transducers. Manipulations include automata construction from regular
|
|
expresssions, determinization (both for finite-state acceptors and
|
|
finite-state transducers), minimization, composition, complementation,
|
|
intersection, Kleene closure, etc. In addition to atomic symbols,
|
|
automata can be defined by means of `predicates' on arcs. Various
|
|
visualization tools are available to browse finite-state
|
|
automata. Interpreters are provided to apply finite automata. Finite
|
|
automata can also be compiled into stand-alone C programs.<p class="style3">
|
|
|
|
Recent versions of FSA are available for SWI-Prolog, SICStus Prolog
|
|
and YAP. The toolbox comes with an optional graphical user interface
|
|
(only available under SICStus) and an optional command
|
|
interpreter. The toolbox can also be applied as a UNIX filter, or as a
|
|
Prolog library. The toolbox is freely available under GPL.
|
|
|
|
<li>
|
|
<p class="style3"> <A HREF="http://www.ncc.up.pt/~mig/SceX.html">SceX: A Symbolic
|
|
Music Processing System</A></p>
|
|
<p class="style3">
|
|
|
|
SceX (pronounce it skech for score (T)eX) is a system that processes textual
|
|
descriptions of music pieces.
|
|
|
|
|
|
</p>
|
|
</blockquote>
|
|
|
|
</body>
|
|
</html>
|