Sciweavers

4488 search results - page 718 / 898
» Properties of NP-Complete Sets
Sort
View
COLING
1996
15 years 7 months ago
Analysis of Japanese Compound Nouns by Direct Text Scanning
This paper aims to analyze word dependency structure in compound nouns appearing in Japanese newspaper articles. The analysis is a dil't:icult problem because such compound n...
Toru Hisamitsu, Yoshihiko Nitta
DLOG
1996
15 years 7 months ago
Resolving Semantic Heterogeneity in Databases with a Terminological Model: Correspondence Refinement
The success of schema integration in multidatabase systems relies heavily on the determination of complete and refined correspondence relationships between them. So, the candidate...
Ounissa Larab, Aïcha-Nabila Benharkat
AAAI
1990
15 years 6 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
IJCAI
1989
15 years 6 months ago
Prediction is Deduction but Explanation is Abduction
This paper presents an approach to temporal reasoning in which prediction is deduction but explanation is abduction. It is argued that all causal laws should be expressed in the n...
Murray Shanahan
LFP
1992
153views more  LFP 1992»
15 years 6 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen