Search

Your search keyword '"Brewka, G"' showing total 13 results
Start Over Author "Brewka, G" Database OAIster
13 results on '"Brewka, G"'

1. Undecidability of Fuzzy Description Logics

Author

Brewka, G, Eiter, T, McIlraith, SA, Borgwardt, S, Penaloza, R, Brewka, G, Eiter, T, McIlraith, SA, Borgwardt, S, and Penaloza, R

Abstract

Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to formalize and reason with imprecise concepts. Very recently, it has been shown that for several fuzzy DLs, reasoning becomes undecidable. Although the proofs of these results differ in the details of each specific logic considered, they are all based on the same basic idea. In this paper, we formalize this idea and provide sufficient conditions for proving undecidability of a fuzzy DL. We demonstrate the effectiveness of our approach by strengthening all previously-known undecidability results and providing new ones. In particular, we show that undecidability may arise even if only crisp axioms are considered.

Published
2012

2. Undecidability of Fuzzy Description Logics

Author

Brewka, G, Eiter, T, McIlraith, SA, Borgwardt, S, Penaloza, R, Brewka, G, Eiter, T, McIlraith, SA, Borgwardt, S, and Penaloza, R

Abstract

Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to formalize and reason with imprecise concepts. Very recently, it has been shown that for several fuzzy DLs, reasoning becomes undecidable. Although the proofs of these results differ in the details of each specific logic considered, they are all based on the same basic idea. In this paper, we formalize this idea and provide sufficient conditions for proving undecidability of a fuzzy DL. We demonstrate the effectiveness of our approach by strengthening all previously-known undecidability results and providing new ones. In particular, we show that undecidability may arise even if only crisp axioms are considered.

Published
2012

3. Meta-Typicalness Approach to Reliable Classification

Author

Brewka, G., Coradeschi, S, Perini, A, TRaverso, P., Smirnov, E.N., Vanderlooy, S., Sprinkhuizen-Kuyper, I.G., Brewka, G., Coradeschi, S, Perini, A, TRaverso, P., Smirnov, E.N., Vanderlooy, S., and Sprinkhuizen-Kuyper, I.G.

Abstract

Item does not contain fulltext

Published
2006

4. Version Space Support Vector Machines

Author

Brewka, G., Coradeschi, S., Perini, A., Traverso, P., Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I., Vanderlooy, S., Brewka, G., Coradeschi, S., Perini, A., Traverso, P., Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I., and Vanderlooy, S.

Abstract

Item does not contain fulltext

Published
2006

7. Meta-Typicalness Approach to Reliable Classification

Author

Brewka, G., Coradeschi, S, Perini, A, TRaverso, P., Smirnov, E.N., Vanderlooy, S., Sprinkhuizen-Kuyper, I.G., Brewka, G., Coradeschi, S, Perini, A, TRaverso, P., Smirnov, E.N., Vanderlooy, S., and Sprinkhuizen-Kuyper, I.G.

Abstract

Item does not contain fulltext

Published
2006

8. Version Space Support Vector Machines

Author

Brewka, G., Coradeschi, S., Perini, A., Traverso, P., Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I., Vanderlooy, S., Brewka, G., Coradeschi, S., Perini, A., Traverso, P., Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I., and Vanderlooy, S.

Abstract

Item does not contain fulltext

Published
2006

9. Version Space Support Vector Machines

Author

Brewka, G., Coradeschi, S., Perini, A., Traverso, P., Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I., Vanderlooy, S., Brewka, G., Coradeschi, S., Perini, A., Traverso, P., Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I., and Vanderlooy, S.

Abstract

Item does not contain fulltext

Published
2006

12. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences

Author

Brewka, G. and Brewka, G.

Abstract

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach., Comment: See http://www.jair.org/ for any accompanying files

Published
1996

Catalog

Books, media, physical & digital resources
See catalog results