2962 search results - page 377 / 593 » Reasoning on Association Rules |
182
click to vote
FUZZIEEE
2007
IEEE
16 years 28 days ago
2007
IEEE
— Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. It is well known that the choice of the fuzzy operat...
145
click to vote
LICS
2007
IEEE
16 years 26 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
185
click to vote
TPHOL
2007
IEEE
16 years 26 days ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
194
click to vote
CSL
2007
Springer
16 years 23 days ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
186
click to vote
ICLP
2007
Springer
16 years 23 days ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...