Sciweavers

670 search results - page 20 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
EPIA
2007
Springer
14 years 1 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
JIFS
2006
120views more  JIFS 2006»
13 years 7 months ago
Building similarity metrics reflecting utility in case-based reasoning
Fundamental to case-based reasoning is the idea that similar problems have similar solutions. The meaning of the concept of "similarity" can vary in different situations...
Ning Xiong, Peter Funk
CONTEXT
2001
Springer
14 years 4 days ago
On the Dimensions of Context Dependence: Partiality, Approximation, and Perspective
Abstract. In this paper we propose to re-read the past work on formalizing context as the search for a logic of the relationships between partial, approximate, and perspectival the...
Massimo Benerecetti, Paolo Bouquet, Chiara Ghidini
AGP
1995
IEEE
13 years 11 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
FLOPS
1999
Springer
13 years 12 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer