Accueil

M.H. van Emden

  1. Constraint Propagation as Information Maximization.

    Fri, 01/27/2012 - 15:01 — SomNambul
    Authors: M.H. van Emden, A. Nait Abdallah
    Subjects: Artificial Intelligence
    Abstract

    Dana Scott used the partial order among partial functions for his
    mathematical model of recursively defined functions. He interpreted the partial
    order as one of information content. In this paper we elaborate on Scott's
    suggestion of regarding computation as a process of information maximization by
    applying it to the solution of constraint satisfaction problems. Here the
    method of constraint propagation can be interpreted as decreasing uncertainty
    about the solution -- that is, as gain in information about the solution.

  2. Integrating Interval Constraints into Logic Programming.

    Tue, 02/09/2010 - 16:02 — SomNambul
    Authors: M.H. van Emden
    Subjects: Programming Languages
    Abstract

    The CLP scheme uses Horn clauses and SLD resolution to generate multiple
    constraint satisfaction problems (CSPs). The possible CSPs include rational
    trees (giving Prolog) and numerical algorithms for solving linear equations and
    linear programs (giving CLP(R)). In this paper we develop a form of CSP for
    interval constraints. In this way one obtains a logic semantics for the
    efficient floating-point hardware that is available on most computers.

Math-arch

Syndicate content