Newsgroups: comp.lang.prolog,comp.theory
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!zombie.ncsc.mil!news.duke.edu!news-feed-1.peachnet.edu!gatech!newsfeed.pitt.edu!uunet!nntp.hk.super.net!news.ust.hk!kean
From: kean@cs.ust.hk (Alex Kean)
Subject: Re: Complexity of Resolution Theorem Proving/Abduction
Message-ID: <1995Mar23.055450.28839@uxmail.ust.hk>
Sender: usenet@uxmail.ust.hk (usenet account)
Nntp-Posting-Host: cssu49.cs.ust.hk
Organization: Computer Science, HKUST
References: <3kqai4$dp2@senator-bedfellow.MIT.EDU>
Distribution: inet
Date: Thu, 23 Mar 1995 05:54:50 GMT
Lines: 31
Xref: glinda.oz.cs.cmu.edu comp.lang.prolog:12537 comp.theory:12052

In article <3kqai4$dp2@senator-bedfellow.MIT.EDU> Cheng Hian Goh <chgoh@rombutan.mit.edu> writes:
>I am trying to apply the abductive framework of Eshghi and Kolwaski
>and wonder if anyone has done a study of its complexity. If you know
>of any papers or results, I will greatly appreciate if you can point 
>me to it.
>
>Regards,
>Cheng
>

No, I don't know. But the following paper mightbe of interest
to you.

@article{bylanderetal91,
  author    = "Tom Bylander and Dean Allemang and Michael C. Tanner 
               and John R. Josephson",
  title     = "{The Computational Complexity of Abduction}",
  journal     = "Artificial Intelligence",
  volume      = 49,
  year      = 1991,
  pages     = {25--60}
}

Alex Kean
-- 
-------------------------------------------------------------------------
Alex Kean 
Department of Computer Science                      Email: kean@cs.ust.hk
The Hong Kong University of Science & Technology    Tel: (852) 235 869 92
Clear Water Bay, Kowloon, HONG KONG                 Fax: (852) 235 814 77
-------------------------------------------------------------------------
