3047 search results - page 392 / 610 » On the Meaning of Logical Completeness |
POPL
1998
ACM
15 years 2 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
RSCTC
2000
Springer
15 years 2 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
112
click to vote
EKAW
2008
Springer
15 years 12 days ago
2008
Springer
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
DLOG
2003
15 years 1 days ago
2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
86
Voted
ENTCS
2008
14 years 10 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...