On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
FLUX: A logic programming method for reasoning agents
Theory and Practice of Logic Programming
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
A declarative agent programming language based on action theories
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Pellet-HeaRT - proposal of an architecture for ontology systems with rules
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Integration proposal for description logic and attributive logic: towards semantic web rules
Transactions on computational collective intelligence II
Foundations of instance level updates in expressive description logics
Artificial Intelligence
Hi-index | 0.00 |
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, updates generate so-called Boolean ABoxes, which cannot be handled by traditional Description Logic reasoners. Second, iterated update operations result in very large Boolean ABoxes, which, however, contain a huge amount of redundant information. In this paper, we address both issues from a practical point of view.