Theory-Contraction is NP-Complete
From MaRDI portal
Publication:4465167
DOI10.1093/jigpal/11.6.675zbMath1042.03018OpenAlexW2008655760MaRDI QIDQ4465167
Publication date: 27 May 2004
Published in: Logic Journal of IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8e62c905f6044495a2a04b59afde809495dfde4a
Logics of knowledge and belief (including belief change) (03B42) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
BELIEF-REVISION, THE RAMSEY TEST, MONOTONICITY, AND THE SO-CALLED IMPOSSIBILITY RESULTS ⋮ New foundations for a relational theory of theory-revision ⋮ Preference-based belief revision for rule-based agents ⋮ Contracting intuitionistic theories
This page was built for publication: Theory-Contraction is NP-Complete