Exploiting domain structure to achieve efficient temporal reasoning

Authors:
Mike Williamson;Steve Hanks
Affiliations:
Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 10
Cited 0

Temporal data base management

Artificial Intelligence
Constraint propagation with interval labels

Artificial Intelligence
Reasoning About Time in Higher-Level Language Software

IEEE Transactions on Software Engineering
Using temporal hierarchies to efficiently maintain large temporal databases

Journal of the ACM (JACM)
Representations of commonsense knowledge

Representations of commonsense knowledge
Readings in qualitative reasoning about physical systems

Readings in qualitative reasoning about physical systems
Constraint propagation algorithms for temporal reasoning: a revised report

Readings in qualitative reasoning about physical systems
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Maintaining knowledge about temporal intervals

Communications of the ACM
Projecting plans for uncertain worlds

Projecting plans for uncertain worlds

Quantified Score

Hi-index	0.00

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 ...