Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!udel!news.sprintlink.net!pipex!uunet!nctuccca.edu.tw!news.cc.nctu.edu.tw!news.nsysu.edu.tw!ruby.ee.nsysu.edu.tw!cclai
From: cclai@ruby.ee.nsysu.edu.tw (Chi-Chia Lai)
Subject: Skolemization implementation problem
Message-ID: <1994Nov11.151054.9977@news.nsysu.edu.tw>
Sender: news@news.nsysu.edu.tw
Organization: National Sun Yat-Sen University,Taiwan,R.O.C.
X-Newsreader: TIN [version 1.2 PL2]
Date: Fri, 11 Nov 1994 15:10:54 GMT
Lines: 21

Hi,everybody:
   In automated theorem prover implementation,I write a "translator" in
   Common Lisp to translate theorems(in first order logic format) to
   clausal form for "resolution" method. The inference rule seems easy.
   BUT,during translator implementation,how to drop existial variable?
   In some books, Skolem constant and Skolem function are mentioned.
   Unfortunely,I can not find any implementation about the Skolemization.

   Therefore,I hope to know:
   (1) Which paper or books can give me some help in Skolemization
       implementation problem. or
   (2) Any other method that can translate context(in first order logic)
       to clausal form(used in resolution inference method).
   (3) Is some theorem-prover use resolution inference method?

   I will be appreciate for your any help! Thank you very much!

Cheers,
                                           Chi-Chia Lai
                                           e-mail:cclai@ruby.ee.nsysu.edu.tw

