Skip to Main Content (Press Enter)

Logo UNISS
  • ×
  • Home
  • Degrees
  • Courses
  • Jobs
  • People
  • Outputs
  • Organizations
  • Third Mission
  • Expertise & Skills

Logo UNISS

|

UNIFIND

uniss.it
  • ×
  • Home
  • Degrees
  • Courses
  • Jobs
  • People
  • Outputs
  • Organizations
  • Third Mission
  • Expertise & Skills
  1. Outputs

A survey on applications of quantified boolean formulas

Conference Paper
Publication Date:
2019
Short description:
A survey on applications of quantified boolean formulas / Shukla, A., Biere, A., Pulina, L., Seidl, M.. - 2019-:(2019), pp. 78-84. (31st IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2019 usa 2019) [10.1109/ICTAI.2019.00020].
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.
Iris type:
4.1 Contributo in Atti di convegno
Keywords:
QBF; SAT Applications; Satisfiability
List of contributors:
Shukla, A.; Biere, A.; Pulina, L.; Seidl, M.
Authors of the University:
PULINA Luca
Handle:
https://iris.uniss.it/handle/11388/239898
Book title:
Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI
Published in:
PROCEEDINGS - INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE
Series
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.6.0.0