Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web

doi:10.4018/jswis.2008070104

Reference Hub

This research has been cited in:

Conference
On the use of fuzzy stable models for inconsistent classical logic programs2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI)10.1109/FOCI.2011.5949476
Chapter
All About Fuzzy Description Logics and ApplicationsReasoning Web. Web Logic Rules10.1007/978-3-319-21768-0_1
Chapter
Uncertainty in the Semantic WebScalable Uncertainty Management10.1007/978-3-642-04388-8_2
Chapter
Uncertainty Reasoning for the Semantic WebReasoning Web. Semantic Interoperability on the Web10.1007/978-3-319-61033-7_8
Chapter
Uncertainty Reasoning for the Semantic WebWeb Reasoning and Rule Systems10.1007/978-3-642-05082-4_3
Article
A top-k query answering procedure for fuzzy logic programmingFuzzy Sets and Systems10.1016/j.fss.2012.01.016
Chapter
Tractable Probabilistic Description Logic ProgramsAdvances in Probabilistic Databases for Uncertain Information Management10.1007/978-3-642-37509-5_6
Conference
Tightly coupled fuzzy rough description logic programs under the answer set semantics for the semantic web2014 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)10.1109/FUZZ-IEEE.2014.6891558
Article
A Novel Combination of Answer Set Programming with Description Logics for the Semantic WebIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2010.111
Chapter
Hybrid Reasoning with Rules and OntologiesSemantic Techniques for the Web10.1007/978-3-642-04581-3_1
Chapter
From Fuzzy to Annotated Semantic Web LanguagesReasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering10.1007/978-3-319-49493-7_6
Article
Formal and relational concept analysis for fuzzy-based automatic semantic annotationApplied Intelligence10.1007/s10489-013-0451-7
Article
A polynomial Time Subsumption Algorithm for Nominal SafeELO⊥under Rational ClosureInformation Sciences10.1016/j.ins.2018.09.037
Article
Rough Description Logic ProgramsJournal of Computers10.4304/jcp.7.11.2719-2725
Article
A General Datalog-Based Framework for Tractable Query Answering Over OntologiesSSRN Electronic Journal10.2139/ssrn.3198957
Conference
Decision supporting system based on fuzzy default reasoning2009 2nd Conference on Human System Interactions10.1109/HSI.2009.5090949

Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web

Thomas Lukasiewicz, Umberto Straccia

Source Title: International Journal on Semantic Web and Information Systems (IJSWIS)4(3)

Cite Article Cite Article

MLA

Lukasiewicz, Thomas, and Umberto Straccia. "Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web." IJSWIS vol.4, no.3 2008: pp.68-89. http://doi.org/10.4018/jswis.2008070104

APA

Lukasiewicz, T. & Straccia, U. (2008). Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web. International Journal on Semantic Web and Information Systems (IJSWIS), 4(3), 68-89. http://doi.org/10.4018/jswis.2008070104

Chicago

Lukasiewicz, Thomas, and Umberto Straccia. "Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web," International Journal on Semantic Web and Information Systems (IJSWIS) 4, no.3: 68-89. http://doi.org/10.4018/jswis.2008070104

Export Reference

Favorite Full-Issue Download

View Full Text PDF

Abstract

We present a novel approach to fuzzy description logic programs (or simply fuzzy dl-programs) under the answer set semantics, which is a tight integration of fuzzy disjunctive logic programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly coupled disjunctive dl-programs by fuzzy vagueness in both the description logic and the logic program component. We show that the new formalism faithfully extends both fuzzy disjunctive logic programs and fuzzy description logics, and that under suitable assumptions, reasoning in the new formalism is decidable. We present a polynomial reduction of certain fuzzy dl-programs to tightly coupled disjunctive dl-programs, and we analyze the complexity of consistency checking and query processing for certain fuzzy dl-programs. Furthermore, we provide a special case of fuzzy dl-programs for which deciding consistency and query processing can both be done in polynomial time in the data complexity.

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.

Username or email: *

Password: *

Forgot individual login password?

Create individual account

Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web

MLA

APA

Chicago

Export Reference

Abstract

Request Access