INRIA
  Team LIS


-----------------------
LOGFUN
-----------------------

Downloads

Current version: 1.5.2

  • Sources: tar-gzipped sources with 2 examples of complex logics. Installing from sources requires Objective Caml 3.09 or higher as all sources are coded in this language.

Version
Date
LOGFUN sources
1.5.2
09-07-2009
download
1.5.1
26-02-2009
download
1.5
23-09-2008
download
1.4
20-04-2007
download
1.3.1
20-06-2006
download
1.3
21-12-2005
download
1.2.1 (bug fix)
05-09-2005
download
1.2
10-05-2005
download

Version 1.5.2


Bug fix, and upgrade w.r.t. OCaml 3.11.

Version 1.5.1


Compatibility with OCaml 3.10 compilers.

Version 1.5


The following logic functors have been modified or added:
  • Numpow: numbers (union of integers and floats)
  • Openinterval: connectors <= and >= can be used to represent half-bounded intervals
  • Attr: axioms can be defined from atoms to terms (instead of between terms only)
  • Mercurytype: predicate signatures in the Mercury programming language
  • Pregrouptype: word types in lexicalized grammars based on pregroups (applied to natural languages)
  • Empty and Insert: as a replacement of Sum for large sums of logics (more space-efficient)
    Sum(X,Sum(Y,Z)) peut être remplacé par Insert(X,Insert(Y,Insert(Z,Empty)))

Version 1.4


The following logic functors have been modified or added:
  • Date: patterns such as '2 days ago', '10 years ago'
  • Time: patterns such as '3 hours ago', like for dates
  • Intpow: compact notations for large numbers such as '1-k' = '1----' = [10000,20000[
    uses standard notations: k(ilo), M(ega), G(iga), T(era), P(eta), E(ta)
  • Substring: regular expressions as patterns
  • Permissions: new functor for representing access permissions on Unix files

Version 1.3.1

  • Fine-tuning of logic functor properties in order to build more complex logics.
  • New logic functors: Enum, Date_pattern, Mltype, Javatype.
  • Two complex logics as examples with  good properties,  and examples of formulas and subsumption test:
    • Reconstruction of the description logic ALC, and variants of it (concrete domains, complex roles, Closed World Assumption)
    • A typical logic for logical information systems

Version 1.3

  • Full revision w.r.t. theory. Properties over built logics can be computed automatically.

Version 1.2.1 (bug fix)

  • In functor Sentence, 2 values (exact strings) are equivalent only if they are equal.

Version 1.2

  • First public release.



Last modification: 9 July 2009