Hybrid Reasoning with Forest Logic Programs


Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist. In this paper, we provide a sound, complete, and terminating algorithm for satisfiability checking w.r.t. forest logic programs, a fragment where rules have a… (More)
DOI: 10.1007/978-3-642-02121-3_27
View Slides


3 Figures and Tables

Cite this paper

@inproceedings{Feier2009HybridRW, title={Hybrid Reasoning with Forest Logic Programs}, author={Cristina Feier and Stijn Heymans}, booktitle={ESWC}, year={2009} }