Between proof construction and SAT-solving (2405.05670v2)
Abstract: The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for implicational intuitionistic propositional logic (IIPC) can serve as a similar natural tool to express problems in Pspace. This approach can be particularly convenient for two reasons. One is that provability in full IPC (with all connectives) can be reduced to provability of implicational formulas of order three. Another advantage is a convenient interpretation in terms of simple alternating automata. Additionally, we distinguish some natural subclasses of IIPC corresponding to the complexity classes NP and co-NP. Our experimental results show that a simple decision procedure requires a significant amount of time only in a small fraction of cases.
- \bibfitemHoosStutzle05 \guyH. H.Holger H.Hoos and \guyT.ThomasStützle 20050 \guysmagicHolger H. Hoos \biband Thomas Stützle Stochastic Local Search. Foundations and Applications, Elsevier\yearmagic,2005. \TheSortKeyIshoos holger h stützle thomas 2005 stochastic local search foundations and applications
- \bibfitemterese \guyTerese 20030 \guysmagicTerese Term rewriting systems, Cambridge University Press\yearmagic,2003. \TheSortKeyIsterese 2003 term rewriting systems
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.