Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Answer set programming and plan generation
Artificial Intelligence
Representations of health concepts: a cognitive perspective
Journal of Biomedical Informatics
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
A Defeasible Ontology Language
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Multilayered Extended Semantic Networks as a Language for Meaning Representation in NLP Systems
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
Integrating Ontology Languages and Answer Set Programming
DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications
TINLAP '78 Proceedings of the 1978 workshop on Theoretical issues in natural language processing
The Description Logic Handbook
The Description Logic Handbook
Hi-index | 0.00 |
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. However, it seems that the problem concerns not only reasoning over knowledge but knowledge itself, where apart from nondefeasible knowledge the defeasible knowledge can be distinguished. In the current paper we rely on the Dual Theory of Concepts, according to which concepts are dually structured into defeasible and nondefeasible parts. We develop a metaontology for representing both types of a concept's structure and apply it for annotating OWL axioms. The translation of annotated OWL axioms into a logic program under answer set semantics is provided. Hence the answer set solver Smodels may be used as reasoner for annotated ontologies, handling properly the distinction between monotonic and nonmonotonic reasoning.