Quantitative Set Reasoning
In Section 6.1.4, we examined techniques for translating the propositional consistency problem into decidable subproblems of the set-satisfiability problem; we also saw, in Sections 6.1.3 and 6.3.2, techniques for translating Hilbert’s tenth problem into more general instances of the set-satisfiability problem. The main purpose there was to detect limitations (lower complexity bounds which in special cases yield undecidability) opposing the solution of the set-satisfiability problem.
KeywordsInteger Linear Program Logic Programming Integer Variable Atomic Formula Integer Linear Program Problem
Unable to display preview. Download preview PDF.