Provably bounded optimal agents

Authors:
Stuart J. Russell;Devika Subramanian;Ronald Parr
Affiliations:
University of California, Berkeley, CA;Cornell University, Ithaca, NY;University of California, Berkeley, CA
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 7
Cited 6

A theory of the learnable

Communications of the ACM
Logic and artificial intelligence

Artificial Intelligence
Do the right thing: studies in limited rationality

Do the right thing: studies in limited rationality
Tractable decision-analytic control

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Principles of metareasoning

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Toward efficient agnostic learning

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Control of problem solving: principles and architecture

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence

Efficient exploration for optimizing immediate reward

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
From Statistics to Emergence: Exercises in Systems Modularity

EASSS '01 Selected Tutorial Papers from the 9th ECCAI Advanced Course ACAI 2001 and Agent Link's 3rd European Agent Systems Summer School on Multi-Agent Systems and Applications
Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment

ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Decentralized monitoring of distributed anytime algorithms

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Reasoning, metareasoning, and mathematical truth: studies of theorem proving under limited resources

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Multiagent meta-level control for radar coordination

Web Intelligence and Agent Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...