HiLog(ID:1489/hil001)

W. Chen et al, Stony Brook, 1989. Logic programming in higher order logic.



Structures:
Related languages
DATALOG => HiLog   Extension of
HiLog => SWORD   Influence
References:
  • Chen, W. et al, "HiLog as a Platform for Database Languages (Or Why Predicate Calculus is Not Enough)" view details
          in 2nd Intl Workshop on Database Prog Langs, Morgan Kaufmann, 1989 view details
  • Liu, M. Overview of Datalog Extensions. In Proceedings of the 6th International Workshop on Deductive Database and Logic Programming (DDLP 98), Manchester, UK, June 20, 1998 view details Extract: Hilog
    Hilog
    Hilog is a typed extension of Datalog that intends to solve part of the problems of LDL. In Hilog, every set or tuple must be associated with a name which can be viewed as an atom  or a functor of Prolog.
    [...]Note that the names associated with tuples and sets must be unique (unique name as- sumption).
    [...]Sets in Hilog have a special meaning.
    [...]With the unique name assumption, nested terms in Hilog can be directly used as atoms.
    [...]Hilog has the following limitations. First, it does not allow negation. Besides, the special treatment of sets in Hilog does not allow us to explicitly specify what a set exactly contains.  Therefore, set enumeration of LDL is not supported. Another problem with Hilog is that the  unique name assumption is not practical for large databases.
          in 2nd Intl Workshop on Database Prog Langs, Morgan Kaufmann, 1989 view details
    Resources
    • SB ftp

      "