ITR: Inference in AI, Verification, and Theory: A Unified Approach
ITR: Inference in AI, Verification, and Theory: A Unified Approach
批准号:
0219468
负责人:
Paul Beame
金额:
$49.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2002
资助国家:
美国
项目状态:
已结题
起止时间:
2002-09-01 至 2006-08-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
The problem of developing efficient automated systems of logicalinference is a key step toward the dream of creating verifiable,reliable, and secure hardware and software systems. This research isaimed at developing a well-founded, unified theory of practicallogical inference, that combines complementary ideas and powerfulapproaches for propositional inference developed in AI, formalverification, and theoretical computer science.This unified theory will focus on (ii) combining the differentrepresentations used in the various approaches to propositionalinference, such as Boolean decision diagrams and conjunctive normalform, in order to take advantage of the diverse algorithmic techniquesassociated with each; (ii) developing new and improved inferencealgorithms using the combined representation; (iii) preciselycharacterizing the power of various heuristic inference techniques,such as clause learning and randomized search; and (iv) developing arigorous understanding of how problem structure indicates thepotential effectiveness of particular inference strategies.The research will involve theoretical work using methods of proofcomplexity as well as experimental work on logical encodings of bothreal-world verification problems and AI planning problems. Theultimate goal research is to significantly expand the size andcomplexity of software and hardware systems that are amenable toformal analysis.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Complexity of Representations for Inference
-
批准号:2006359
-
项目类别:Standard Grant
-
资助金额:$35.0万
-
财政年份:2020
-
负责人:Paul Beame
-
依托单位:
SHF: Small: Efficient Verification of Nonlinear Arithmetic
-
批准号:1714593
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2017
-
负责人:Paul Beame
-
依托单位:
AF: Small: Communication and Resource Tradeoffs
-
批准号:1524246
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2015
-
负责人:Paul Beame
-
依托单位:
AF: Small:Tradeoffs among Measures in Computational and Proof Complexity
-
批准号:1217099
-
项目类别:Standard Grant
-
资助金额:$44.0万
-
财政年份:2012
-
负责人:Paul Beame
-
依托单位:
AF: Large: Collaborative Research: Reliable Quantum Communication and Computation in the Presence of Noise
-
批准号:1111382
-
项目类别:Continuing Grant
-
资助金额:$128.63万
-
财政年份:2011
-
负责人:Paul Beame
-
依托单位:
Travel Support for IEEE Symposium on Foundations of Computer Science (FOCS 2011)
-
批准号:1147364
-
项目类别:Standard Grant
-
资助金额:$1.2万
-
财政年份:2011
-
负责人:Paul Beame
-
依托单位:
Travel Support for the Symposium on Foundations of Computer Science (FOCS 2010)
-
批准号:1049485
-
项目类别:Standard Grant
-
资助金额:$1.5万
-
财政年份:2010
-
负责人:Paul Beame
-
依托单位:
AF: Small: Graph Isomorphism and Quantum Random Walks by Anyons
-
批准号:0916400
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:2009
-
负责人:Paul Beame
-
依托单位:
Semi-algebraic complexity and models for massive data set processing
-
批准号:0830626
-
项目类别:Continuing Grant
-
资助金额:$41.45万
-
财政年份:2008
-
负责人:Paul Beame
-
依托单位:
Communication Complexity, Proof Complexity, and Approximation
-
批准号:0514870
-
项目类别:Continuing Grant
-
资助金额:$20.0万
-
财政年份:2005
-
负责人:Paul Beame
-
依托单位:
Lower Bounds for Time-space Tradeoffs, Data Structures, and Proof Complexity
-
批准号:0098066
-
项目类别:Standard Grant
-
资助金额:$29.7万
-
财政年份:2001
-
负责人:Paul Beame
-
依托单位:
Computational and Proof Complexity Bounds
-
批准号:9800124
-
项目类别:Standard Grant
-
资助金额:$21.3万
-
财政年份:1998
-
负责人:Paul Beame
-
依托单位:
Computational Complexity Lower Bounds
-
批准号:9303017
-
项目类别:Continuing Grant
-
资助金额:$19.32万
-
财政年份:1994
-
负责人:Paul Beame
-
依托单位:
PYI: Resource Bounds and Parallel Computation.
-
批准号:8858799
-
项目类别:Continuing Grant
-
资助金额:$27.45万
-
财政年份:1988
-
负责人:Paul Beame
-
依托单位:
海外基金