🚀 go-pugleaf

From: Hans-Juergen Buerckert <unido!informatik.uni-kl.de!buerkert>
To: mod-ki@unido.informatik.uni-dortmund.de
Date: Wed, 25 Apr 90 10:41:55 MET DST
Subject: Ergaenzung zu CADE-10 Infos (mod-ki 427)
Keywords: Konferenzen

mod-ki message 0441
************************************************************************
Hier ein Nachtrag zur Registration Info fuer die  CADE-10.  Dort  fehlte
die Beschreibung des Tutorials C. Hier ist sie:
 

        Computing Models of Propositional Logics
 
        Paul Pritchard (University of Queensland)
        John Slaney (Australian National University)

The technique of modelling  propositional  logics  by  means  of  finite
algebras is at least as old as many-valued logic and has  provided  much
information about such non-classical systems as relevant logics,  linear
logic and connexive logic. The problem of enumerating these algebras  is
one of satisfying finite constraints and so solutions to  it  generalise
widely.  "Generate  and  Test"  methods  suffer   from   a   prohibitive
exponential  complexity  which  has  generally  inhibited  investigation
except in trivial cases.

In this tutorial we present radical improvements on the naive  backtrack
algorithm.  These  have  made  it  possible  to  enumerate  quite  large
structures suitable for modelling "difficult" logics.  We  also  discuss
recent work in parallelising  both  the  generating  programs  and  some
applications.

Bitte, diese ebenso weiterverteilen wie die Infos selbst. Danke.
Hans-Juergen Buerckert
************************************************************************