Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
C. Feier, S. Heymans:
"A Sound and Complete Algorithm for Simple Conceptual Logic Programs";
Vortrag: 3rd International Workshop on Applications of Logic Programming on the (Semantic) Web and Web Services (ALPSWS 2008),
Udine, Italy;
12.12.2008; in: "Proceedings of 3rd International Workshop on Applications of Logic Programming on the (Semantic) Web and Web Services (ALPSWS 2008)",
CEUR Workshop Proceedings,
(2008),
ISSN: 1613-0073;
S. 15
- 28.
Kurzfassung englisch:
Open Answer Set Programming (OASP) is a knowledge rep-
resentation paradigm that allows for a tight integration of Logic Pro-
gramming rules and Description Logic ontologies. Although several de-
cidable fragments of OASP exist, no reasoning procedures for such ex-
pressive fragments were identified so far. We provide an algorithm that
checks satisfiability in nexptime for the fragment of exptime-complete
simple conceptual logic programs.
Schlagworte:
open answer set programming
Elektronische Version der Publikation:
http://publik.tuwien.ac.at/files/PubDat_167776.pdf
Zugeordnete Projekte:
Projektleitung Thomas Eiter:
ONOTRULE - ONTOlogies meet business RULEs
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.