Inproceedings1124: Unterschied zwischen den Versionen
K (Added from ontology) |
K (Added from ontology) |
||
Zeile 1: | Zeile 1: | ||
+ | {{Publikation Author | ||
+ | |Rank=2 | ||
+ | |Author=Markus Krötzsch | ||
+ | }} | ||
{{Publikation Author | {{Publikation Author | ||
|Rank=1 | |Rank=1 | ||
|Author=Pascal Hitzler | |Author=Pascal Hitzler | ||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Inproceedings | {{Inproceedings | ||
Zeile 31: | Zeile 31: | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
|Download=2006_1124_Hitzler_Querying formal_1.pdf | |Download=2006_1124_Hitzler_Querying formal_1.pdf | ||
− | |||
|Projekt=SEKT, SmartWeb, | |Projekt=SEKT, SmartWeb, | ||
|Forschungsgruppe= | |Forschungsgruppe= | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Formale Begriffsanalyse | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Logik | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Domaintheorie | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Nichtmonotones Schließen | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Künstliche Intelligenz | ||
+ | }} | ||
+ | {{Forschungsgebiet Auswahl | ||
+ | |Forschungsgebiet=Logikprogrammierung | ||
}} | }} |
Version vom 15. August 2009, 11:43 Uhr
Querying formal contexts with answer set programs
Querying formal contexts with answer set programs
Published: 2006
Juli
Herausgeber: Henrik Schärfe, Pascal Hitzler and Peter Ohrstrom
Buchtitel: Conceptual Structures: Inspiration and Application, Proceedings of the 14th International Conference on Conceptual Structures, ICCS 2006, Aalborg, Denmark, July 2006
Ausgabe: 4068
Reihe: Lecture Notes in Artificial Intelligence
Seiten: 413-426
Verlag: Springer
Referierte Veröffentlichung
BibTeX
Kurzfassung
Recent studies showed how a seamless integration of formal
concept analysis (FCA), logic of domains, and answer set programming
(ASP) can be achieved. Based on these results for combining hierarchical
knowledge with classical rule-based formalisms, we introduce an expressive
common-sense query language for formal contexts. Although this
approach is conceptually based on order-theoretic paradigms, we show
how it can be implemented on top of standard ASP systems. Advanced
features, such as default negation and disjunctive rules, thus become
practically available for processing contextual data.
Download: Media:2006_1124_Hitzler_Querying formal_1.pdf
Domaintheorie, Formale Begriffsanalyse, Logik, Nichtmonotones Schließen, Logikprogrammierung, Künstliche Intelligenz