2962 search results - page 306 / 593 » Reasoning on Association Rules |
201
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
165
click to vote
AAAI
2008
15 years 9 months ago
2008
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
163
click to vote
DLOG
2008
15 years 9 months ago
2008
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
149
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
190
Voted
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper describes a web-based CBR application competing at the first Computer Cooking Contest at the ECCBR 2008. It describes the technical realisation of our system, ...