Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A faithful integration of description logics with logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Well-founded semantics and the algebraic theory of non-monotone inductive definitions
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Quantified equilibrium logic and hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
An algebraic account of modularity in ID-logic
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
A Deductive System for FO(ID) Based on Least Fixpoint Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Fo(fd): Extending classical logic with rule-based fixpoint definitions
Theory and Practice of Logic Programming
FO(ID) as an extension of DL with rules
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
There are many interesting Knowledge Representation questions surrounding rule languages for the Semantic Web. The most basic one is of course: which kind of rules should be used and how do they integrate with existing Description Logics? Similar questions have already been addressed in the field of Logic Programming, where one particular answer has been provided by the language of FO(ID). FO(ID) is an extension of first-order logic with a rule-based representation for inductive definitions. By offering a general integration of first-order logic and Logic Programs, it also induces a particular way of extending Description Logics with rules. The goal of this paper is to investigate this integration and discover whether there are interesting extensions of DL with rules that can be arrived at by imposing appropriate restrictions on the highly expressive FO(ID).