Fixed-parameter complexity of semantics for logic programs

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Transactions on Computer Logic

Fixed-parameter complexity of semantics for logic programs

Zbigniew Lonc, Miroslaw Truszczynski

Journal Title: ACM Transactions on Computer Logic

Date: 2003

Volume: 4

Issue: 1

p. 91 - 119

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://arxiv.org/pdf/cs.LO/0107027

ftp://ftp.cs.uky.edu/cs/manuscripts/fpt-iclp.ps.gz/fixed-parameter-complexity-of.ps

ftp://ftp.cs.uky.edu/cs/manuscripts/fpt-tocl.ps

For further information about this item go to:

http://doi.acm.org/10.1145/601775.601779

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12