Logic programs with classical negation
Logic programming
CYC: a large-scale investment in knowledge infrastructure
Communications of the ACM
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Distributed Repositories of Highly Expressive Reusable Ontologies
IEEE Intelligent Systems
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The Description Logic Handbook
The Description Logic Handbook
A theory of forgetting in logic programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Solving logic program conflict through strong and weak forgettings
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Answer set programming for the semantic web
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Combining safe rules and ontologies by interfacing of reasoners
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top of description logic and thus some attractive features of ASP can be employed in the design of the Semantic Web architecture. In this paper we first generalize dl-programs by allowing multiple knowledge bases and then accordingly, define the answer set semantics for the dl-programs. A novel technique called forgetting is developed in the setting of dl-programs and applied to ontology merging and aligning.