2004/02/23 by Paolo Liberatore, Liberatore, Paolo
Computer Science · #AI-based Problem Solving and Planning #Advanced Database Systems and Queries #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences #I.2.8 #Logic, Reasoning, and Knowledge #cs.AI #cs.CC
paper · pdf · doi:10.48550/arxiv.cs/0402053
arxiv created 2004/02/23 · openalex publication_date 2004/02/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is relevant whenever instances may change from time to time, and known solutions may not remain valid after the change. We consider two scenarios: in the first one, what is known is only a solution of the problem before the change; in the second case, we assume that some additional information, found during the search for this solution, is also known. In the first setting, the techniques from the theory of NP-completeness suffice to show complexity results. In the second case, negative results can only be proved using the techniques of compilability, and are often related to the size of considered changes.