Aus Aifbportal
Version vom 16. Oktober 2009, 23:01 Uhr von Nicole Arlt (Diskussion | Beiträge) (Wikipedia python library)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

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


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