1929 search results - page 69 / 386 » Change Propagation Analysis Using Domain Information |
AIPS
2000
15 years 1 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
KCAP
2003
ACM
15 years 5 months ago
2003
ACM
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
115
click to vote
CP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
101
click to vote
CLEF
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2007. This year we are using forms of the Entry Vocabulary Indexes and Thesaurus...
RSFDGRC
2005
Springer
15 years 5 months ago
2005
Springer
We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps...