Theory-contraction is NP-Complete

Abstract I investigate the problem of contracting a dependency-network with respect to any of its nodes. The resulting contraction must not contain the node in question, but must also be a minimal mutilation of the original network. Identifying successful and minimally mutilating contractions of dependencynetworks is non-trivial, especially when non-well-founded networks are to be taken into account. I prove that the contraction problem is NP-complete.1..
Keywords No keywords specified (fix it)
Categories No categories specified (fix it)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,709
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    Similar books and articles

    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2009-01-28

    Total downloads

    1 ( #275,053 of 549,700 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums