Functional Semantics for Non-prenex QBF

Igor Stéphan

2014

Abstract

Quantified Boolean Formulae (or QBF) are suitable to represent finite two-player games. Current techniques to solve QBF are for prenex QBF and knowledge representation is rarely in this form. We propose in this article a functional semantics for non-prenex QBF. The proposed formalism is symmetrical for validity and non-validity and allows to give different interpretations to the quantifiers. With our formalism, the solution of a non-prenex QBF is consistent with the specification, directly readable by the designer of the QBF and the locality of the knolewge is preserved.

Paper Citation

in Harvard Style

Stéphan I. (2014). Functional Semantics for Non-prenex QBF . In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-758-015-4, pages 358-365. DOI: 10.5220/0004760303580365

in Bibtex Style

@conference{icaart14,
author={Igor Stéphan},
title={Functional Semantics for Non-prenex QBF},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2014},
pages={358-365},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004760303580365},
isbn={978-989-758-015-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - Functional Semantics for Non-prenex QBF
SN - 978-989-758-015-4
AU - Stéphan I.
PY - 2014
SP - 358
EP - 365
DO - 10.5220/0004760303580365