EPSRC Reference: |
EP/C538536/1 |
Title: |
Second Order Quantifier Elimination |
Principal Investigator: |
Gabbay, Professor D |
Other Investigators: |
|
Researcher Co-Investigators: |
|
Project Partners: |
|
Department: |
Computer Science |
Organisation: |
Kings College London |
Scheme: |
Standard Research (Pre-FEC) |
Starts: |
01 November 2005 |
Ends: |
31 January 2007 |
Value (£): |
24,721
|
EPSRC Research Topic Classifications: |
Fundamentals of Computing |
|
|
EPSRC Industrial Sector Classifications: |
No relevance to Underpinning Sectors |
|
|
Related Grants: |
|
Panel History: |
|
Summary on Grant Application Form |
In recent years there has been an explosion in the use of logic in artificial intelligence, agent theory and computer science. there is tension between two aspects of logic in any application. (1) The need to have a strong enough language to express whatever is required, general enough to unify several features involved in the application (2) the need to keep the logic and language tractable for efficient computation.Second order languages are very expressive and allow us to express what we need with ease and simplicity. However, the second-order quantifiers are not computationally friendly.So we have a problem. A partial solution is to give algorithms (when mathematically possible) to eliminate the second order quantifier and study the conditions and meaning of when this can be done!
|
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: |
|