On the existence of polynomial time algorithms for interpolation problems in propositional logic

DOI10.1305/ndjfl/1093638014zbMath0669.03017OpenAlexW2076105706MaRDI QIDQ1118581

Elias Dahlhaus, Amos Israeli, Johann A. Makowsky

Publication date: 1988

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093638014

zbMATH Keywords

propositional formulaedegree of difficultyinterpolant of two formulae

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Interpolation, preservation, definability (03C40)

This page was built for publication: On the existence of polynomial time algorithms for interpolation problems in propositional logic