CRModels Home Page
CRModels is an inference engine for CR-Prolog. It works as a
front-end to smodels.
The current version of CRModels is built on top of the
sources of lparse.
The latest release is 1.56p1. You can see a history of the major changes
The major improvements introduced with the 1.5 release are:
Samples of CR-Prolog programs can be found here and here.
Binary search/Linear search hybrid algorithm.
Various code optimizations (e.g. use of hash lists introduced).
Major code clean-up.
Programs given in input to CRModels have to satisfy the following requirements.
Regular rules are unnamed.
Names of cr-rules cannot be omitted.
All the variables used in the names of cr-rules must have a corresponding
range definition via the the #domain keyword (see this example).
Installation and Usage
You can find installation and usage instructions in the
crmodels is distributed under the GNU Public License.
IMPORTANT: crmodels requires
be installed in a directory that occurs in your PATH variable.
(lparse is not required.)
CRModels should run
without problems on most Unix variants. It was tested under
*BSD and Solaris.
Questions, Bugs, etc.
Send emails to firstname.lastname@example.org.
crmodels was written by Loveleen Kolvekal and Marcello Balduccini.
The inference engine is described in:
CR-Models: An Inference Engine for CR-Prolog
(available from http://www.krlab.cs.ttu.edu/Papers)
Examples of use of CR-Prolog can be found, among other sources, in:
Answer Set Based Design of Highly Autonomous, Rational Agents
Ph.D. Dissertation by Marcello Balduccini
Historically, CR-Prolog was introduced in the paper:
Logic Programs with Consistency-Restoring Rules
by Marcello Balduccini and Michael Gelfond
Back to my home page
Author: Marcello Balduccini (email@example.com)
Last Update: 03/26/2009