| EPSRC Reference: |
GR/R55382/01 |
| Title: |
Algorithms for Quantified Boolean Formulae |
| Principal Investigator: |
Gent, Professor IP |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Computer Science |
| Organisation: |
University of St Andrews |
| Scheme: |
Standard Research (Pre-FEC) |
| Starts: |
01 October 2001 |
Ends: |
30 September 2004 |
Value (£): |
51,807
|
| EPSRC Research Topic Classifications: |
| Artificial Intelligence |
Fundamentals of Computing |
|
| EPSRC Industrial Sector Classifications: |
| Communications |
Electronics |
| Information Technologies |
|
|
| Related Grants: |
|
| Panel History: |
|
|
Summary on Grant Application Form |
|
Quantified Boolean Formulae (QBF), also known as Quantified Satisfiability, is a generalization of the Boolean satisfiability (SAT) problem. It is has both theoretical and practical importance in Artificial Intelligence. The aim of the proposed work is to develop new algorithms for QBF, to analyse them theoretically and empirically, and to show their value in applications such as game playing and hardware verification. The new algorithms will incorporate features such as backjumping and solution caching. The proposed work is ideal for a PhD studentship, being both well defined and broad enough in scope to provide training in a number of research methods within Artificial Intelligence.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.st-and.ac.uk |