Reasoning with Forest Logic Programs and f-hybrid knowledge bases

DOI10.1017/S1471068411000597zbMath1266.68082arXiv1110.2773OpenAlexW2963884565MaRDI QIDQ5298799

Cristina Feier, Stijn Heymans

Publication date: 14 June 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2773

zbMATH Keywords

finite model propertyf-hybrid knowledge basesforest logic programsintegration of rules and ontologiesopen answer sets

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Reasoning with Forest Logic Programs Using Fully Enriched Automata

Cites Work

• Unnamed Item
• Open answer set programming for the semantic web
• Web reasoning and rule systems. Third international conference, RR 2009, Chantilly, VA, USA, October 25--26, 2009, Proceedings
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• Combining answer set programming with description logics for the semantic web
• Complexity results for answer set programming with bounded predicate arities and implications
• Description logics of minimal knowledge and negation as failure

This page was built for publication: Reasoning with Forest Logic Programs and f-hybrid knowledge bases