A Sound and Complete Algorithm for Simple Conceptual Logic Programs

3rd International Workshop on Applications of Logic Programming to the

Cristina Feier ; Stijn Heymans

Others  :  http://CEUR-WS.org/Vol-434/paper2.pdf
PID  :  24655

来源: CEUR

【 摘 要 】

Open Answer Set Programming (OASP) is a knowledge representation paradigm that allows for a tight integration of Logic Programming rules and Description Logic ontologies. Although several decidable fragments of OASP exist, no reasoning procedures for such expressive fragments were identified so far. We provide an algorithm that checks satisfiability in nexptime for the fragment of exptime-complete simple conceptual logic programs.