Institutional Repository

Browsing South African Computer Journal (SACJ) by Subject "Resolution"

Browsing South African Computer Journal (SACJ) by Subject "Resolution"

Sort by: Order: Results:

  • Heuristics for resolution-based set-theoretic proofs 
    Van der Poll, JA; Labuschagne, WA (South African Computer Society (SAICSIT), 1999)
    A formal specification language like Z permits the specifier to construct proofs which corroborate the aptness of the spec­ification. This process may be facilitated by establishing a partnership between the specifier and ...
  • Logic programming: ideal vs practice 
    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 ...
  • The practice of clausification in automatic theorem proving 
    Sutcliffe, G; Melville, S (South African Computer Society (SAICSIT), 1996)
    In the process of resolution based Automatic Theorem Proving, problems expressed in First Order Form (FOF) are transformed by a clausifier to Clause Normal Form (CNF). This research examines and compares clausifiers. ...

Search UnisaIR


Browse

My Account