Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
The Description Logic Handbook
The Description Logic Handbook
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Rewriting Conjunctive Queries over Description Logic Knowledge Bases
Semantics in Data and Knowledge Bases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
Conjunctive queries for a tractable fragment of OWL 1.1
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Approximate OWL-Reasoning with Screech
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Paraconsistent Reasoning for OWL 2
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
ISWC '09 Proceedings of the 8th International Semantic Web Conference
GeoS '09 Proceedings of the 3rd International Conference on GeoSpatial Semantics
Theory and Practice of Logic Programming
Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Querying in EL+ with Nonmonotonic Rules
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Parametrized logic programming
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Efficient inferencing for OWL EL
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
On the semantic relationship between datalog and description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Journal of Artificial Intelligence Research
A better uncle for OWL: nominal schemas for integrating rules and ontologies
Proceedings of the 20th international conference on World wide web
Integration proposal for description logic and attributive logic: towards semantic web rules
Transactions on computational collective intelligence II
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Linked rules: principles for rule reuse on the web
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Inline evaluation of hybrid knowledge bases PhD description
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Local closed world semantics: grounded circumscription for OWL
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Towards a scalable, pragmatic knowledge representation language for the web
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Sorted hyper-predicate knowledge bases for ontologies and rules
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Efficient rule-based inferencing for OWL EL
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Modelling structured domains using description graphs and logic programming
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Extending description logic rules
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Recent advances in integrating OWL and rules (technical communication)
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Complexities of Horn Description Logics
ACM Transactions on Computational Logic (TOCL)
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
Towards an efficient algorithm to reason over description logics extended with nominal schemas
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Datalog-based framework for efficient query answering over fuzzy ontologies
International Journal of Metadata, Semantics and Ontologies
Hi-index | 0.00 |
We introduce $\text{\sf{ELP}}$ as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. $\text{\sf{ELP}}$ is based on the tractable description logic $\mathcal{EL}^{\mathord{+}\mathord{+}}$, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus $\text{\sf{ELP}}$ extends $\mathcal{EL}^{\mathord{+}\mathord{+}}$ with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain range restrictions, and the universal role. We present a reasoning algorithm based on a translation of $\text{\sf{ELP}}$ to Datalog, and this translation also enables the seamless integration of DL-safe rules into $\text{\sf{ELP}}$. While reasoning with DL-safe rules as such is already highly intractable, we show that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in $\text{\sf{ELP}}$ without losing tractability.