The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for the complexity class PSPACE. Beside such theoretical aspects QBF also provides an attractive framework for encoding and solving various application problems ranging from symbolic reasoning in artificial intelligence to the formal verification and synthesis of computing systems. In this paper, we survey the different application areas that exploit QBF technology for solving their specific problems.
A survey on applications of quantified boolean formulas / Shukla, A.; Biere, A.; Pulina, L.; Seidl, M.. - 2019-:(2019), pp. 78-84. ((Intervento presentato al convegno 31st IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2019 tenutosi a usa nel 2019 [10.1109/ICTAI.2019.00020].
A survey on applications of quantified boolean formulas
Pulina L.;
2019
Abstract
The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for the complexity class PSPACE. Beside such theoretical aspects QBF also provides an attractive framework for encoding and solving various application problems ranging from symbolic reasoning in artificial intelligence to the formal verification and synthesis of computing systems. In this paper, we survey the different application areas that exploit QBF technology for solving their specific problems.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
