LATPub707: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 15: | Zeile 15: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Very recently, the tableau-based algorithm for deciding consistency of general fuzzy DL ontologies over | |Abstract=Very recently, the tableau-based algorithm for deciding consistency of general fuzzy DL ontologies over the product t-norm was shown to be incorrect, due to a very weak blocking condition. In this report we take the first steps towards a correct algorithm by modifying the blocking condition, such that the (finite) structure obtained through the algorithm uniquely describes an infinite system of quadratic constraints. We show that this procedure terminates, and is sound and complete in the sense that the input is consistent iff the corresponding infinite system of constraints is satisfiable. | ||
the product t-norm was shown to be incorrect, due to a very weak blocking condition. | |||
In this report we take the first steps towards a correct algorithm by modifying the blocking condition, | |||
such that the (finite) structure obtained through the algorithm uniquely describes an infinite system of | |||
quadratic constraints. | |||
We show that this procedure terminates, and is sound and complete in the sense that the input is | |||
consistent iff the corresponding infinite system of constraints is satisfiable. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 41: | Zeile 34: | ||
year = {2011}, | year = {2011}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:24 Uhr
Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm
Rafael PeñalozaRafael Peñaloza
Rafael Peñaloza
Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 11-03, 2011. LTCS-Report
Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 11-03, 2011. LTCS-Report
- KurzfassungAbstract
Very recently, the tableau-based algorithm for deciding consistency of general fuzzy DL ontologies over the product t-norm was shown to be incorrect, due to a very weak blocking condition. In this report we take the first steps towards a correct algorithm by modifying the blocking condition, such that the (finite) structure obtained through the algorithm uniquely describes an infinite system of quadratic constraints. We show that this procedure terminates, and is sound and complete in the sense that the input is consistent iff the corresponding infinite system of constraints is satisfiable. - Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ Pena-LTCS-11-03,
address = {Dresden, Germany},
author = {Rafael {Pe{\~n}aloza}},
institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
number = {11-03},
title = {Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm},
type = {LTCS-Report},
year = {2011},
}
