Theory-Contraction is NP-Complete

Logic Journal of the IGPL 11 (6):675-693 (2003)
  Copy   BIBTEX

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 dependency-networks 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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The “reality” of the lorentz contraction.Dennis Dieks - 1984 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 15 (2):330-342.
Kernel contraction.Sven Ove Hansson - 1994 - Journal of Symbolic Logic 59 (3):845-859.
How to be R eally Contraction-Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.
A survey of multiple contractions.André Fuhrmann & Sven Ove Hansson - 1994 - Journal of Logic, Language and Information 3 (1):39-75.

Analytics

Added to PP
2009-01-28

Downloads
32 (#495,901)

6 months
5 (#627,481)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Neil Tennant
Ohio State University

References found in this work

No references found.

Add more references