Tractable reasoning in first-order knowledge bases with disjunctive information

Authors:
Yongmei Liu;Hector J. Levesque
Affiliations:
Department of Computer Science, University of Toronto, Toronto, ON, Canada;Department of Computer Science, University of Toronto, Toronto, ON, Canada
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Year:
2005

Citing 8
Cited 3

Tree clustering for constraint networks (research note)

Artificial Intelligence
A decidable first-order logic for knowledge representation

Journal of Automated Reasoning
Limited reasoning in first-order knowledge bases

Artificial Intelligence
Tractable reasoning via approximation

Artificial Intelligence
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A tractability result for reasoning with incomplete first-order knowledge bases

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified epistemic logics for reasoning about knowledge in multi-agent systems

Artificial Intelligence
On first-order definability and computability of progression for local-effect actions and beyond

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Using causal relationships to deal with the ramification problem in action formalisms based on description logics

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	0.02

Visualization

Abstract

We define a generalized strategy eliminability criterion for bimatrix games that considers whether a given strategy is eliminable relative to given dominator & eliminee subsets of the players' strategies. We show that this definition spans a spectrum ...