Institutional Repository

Browsing by Author "Labuschagne, W.A."

Browsing by Author "Labuschagne, W.A."

Sort by: Order: Results:

  • Heidema, J; Labuschagne, W.A. (South African Institute of Computer Scientists and Information Technologists, 1990)
    The theory of semantic information is sketched in an algebraic setting, and automorphisms characterising various degrees of incompatibility are introduced. Data-dependent measures of semantic information are defined in ...
  • Halland, KJ; Labuschagne, W.A. (South African Computer Society (SAICSIT), 1995)
    The relationships between the best-known forms of circumscription are elucidated with the aid of an hypothetical ancestor, which we choose to call naive circumscription.
  • Van der Poll, J.A.; Labuschagne, W.A. (1999-07)
    A formal specification language like Z permits the specifier to construct proofs which collaborate the aptness of the specification. This process may be facilitated by establishing a partnership between the specifier and ...
  • Labuschagne, W.A.; Van der Westhuizen, PL (South African Computer Society (SAICSIT), 1992)
    The logician who encounters logic programming expects it to involve 'using predicate logic as a programming language'. He is soon disillusioned. He discovers that it really means 'programming in PROLOG', which in tum seems ...
  • Labuschagne, W.A.; Van Rooyen, H.O. (Computer Society of South Africa (on behalf of SAICSIT), 1984)
    A technique for partially representing binary group operations by sets of binary relations was devised by Cayley. This technique can be generalised to permit the representation of arbitrary sets of n-ary relations {n ~ ...
  • Labuschagne, W.A.; Miller, MG (South African Computer Society (SAICSIT), 1994)
    Yet another axiomatisation of the Yale shooting scenario is provided. The point illustrated by the axiomatisation is that, when using the situation calculus to represent knowledge about a dynamic system in which actions ...
  • Van der Merwe, A; Labuschagne, W (1996)
    In the middle 80s Smith introduced a new way of deriving fully normalized tables: His method was based on the use of an dependency list and a dependency diagram to produce fifth normal form directly. We introduce the use ...

Search UnisaIR

Browse

My Account