Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/17805Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | ZHANG, Xiaowang | - |
| dc.contributor.author | LIN, Zuoquan | - |
| dc.date.accessioned | 2014-11-19T14:23:35Z | - |
| dc.date.available | 2014-11-19T14:23:35Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 18 (3-4), p. 291-327 | - |
| dc.identifier.issn | 1542-3980 | - |
| dc.identifier.uri | http://hdl.handle.net/1942/17805 | - |
| dc.description.abstract | In this paper, we present a paraconsistent description logic based on quasi-classical logic. Compared to the four-valued description logic, quasi-classical description logic satisfies all of the three basic inference rules (i.e., modus ponens, modus tollens and disjunctive syllogism) so that the inference ability of quasi-classical description logic is closer to that of classical logic. Quasi-classical description logic combines three inclusions (i.e., material inclusion, internal inclusion and strong inclusion) of four-valued description logic so that quasi-classical description logic satisfies the intuitive equivalence. Moreover, we develop a terminable, sound and complete tableau algorithm for quasi-classical description logic. As an important result, the complexity of reasoning problems in quasi-classical description logic is proved to be no higher than that of reasoning problems in description logic. | - |
| dc.description.sponsorship | The National Natural Science Foundation of China. | - |
| dc.language.iso | en | - |
| dc.rights | Copyright © 2012 Old City Publishing. All Rights Reserved. | - |
| dc.subject.other | ontology; description logic; quasi-classical logic; paraconsistent logic; multiple-valued logic; inconsistency-tolerant reasoning; tableau algorithm | - |
| dc.title | Quasi-classical description logic | - |
| dc.type | Journal Contribution | - |
| dc.identifier.epage | 327 | - |
| dc.identifier.issue | 3-4 | - |
| dc.identifier.spage | 291 | - |
| dc.identifier.volume | 18 | - |
| local.bibliographicCitation.jcat | A1 | - |
| dc.description.notes | E-mail Addresses:x.zhang@pku.edu.cn | - |
| dc.relation.references | [1] Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F.Patel-Schneider, editors. (2003). The Description Logic Handbook: Theory, Implementation,and Applications. Cambridge University Press. [2] Franz Baader and Philipp Hanschke. (1991). A scheme for integrating concrete domains into concept languages. In Proceedings of the 17th International Joint Conference on Artificial Intelligence(IJCAI’01), Sydney, Australia, August 24-30, 1991, pages 452–457. Morgan Kaufmann. [3] Franz Baader and Bernhard Hollunder. (1991). A terminological knowledge representation system with complete inference algorithms. In Proceedings of the International Workshop of Processing Declarative Knowledge (PDK’91), Kaiserslautern, Germany, July 1-3, 1991, volume 567 of Lecture Notes in Computer Science, pages 67–86. Springer. [4] Franz Baader, Ian Horrocks, and Ulrike Sattler. (2007). Description Logics. In Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors, Handbook of Knowledge Representation. Elsevier. [5] N. D. Belnap. (1977). A useful four-valued logic. Modern uses of multiple-valued logics, pages 7–73. [6] Philippe Besnard and Anthony Hunter. (1995). Quasi-classical logic: Non-trivializable classical reasoning from incosistent information. In Proceedings of the 3rd European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU’ 95), Fribourg, Switzerland, July 3-5, volume 946 of Lecture Notes in Computer Science, pages 44–51. Springer. [7] Alexander Borgida. (1994). On the relationship between description logic and predicate logic. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM’94), Gaithersburg, Maryland, November 29 - December 2, 1994., pages 219–225. ACM. [8] Francesco M. Donini and Fabio Massacci. (2000). EXPTIME tableaux for ALC. Artificial Intelligence, 124(1):87–138. [9] Michael J. Fischer and Richard E. Ladner. (1979). Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194–211. [10] Giorgos Flouris, Zhisheng Huang, Jeff Z. Pan, Dimitris Plexousakis, and Holger Wache. (2006). Inconsistencies, negations and changes in ontologies. In Proceedings of the 21st National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference (AAAI’06), July 16-20, 2006, Boston, Massachusetts, USA. AAAI Press. [11] Sergio Alejandro Gomez, Carlos Ivan Chesnevar, and Guillermo Ricardo Simari. (2008). An argumentative approach to reasoning with inconsistent ontologies. In Proceedings of the Knowledge Representation OntologyWorkshop (KROW’08), Sydney, Australia, September 17, 2008., volume 90. Australian Computer Society. 25 [12] John Grant and Anthony Hunter. (2006). Measuring inconsistency in knowledge bases. Journal of Intelligence Information Systems, 27(2):159–184. [13] Peter Haase, Frank van Harmelen, Zhisheng Huang, Heiner Stuckenschmidt, and York Sure. (2005). A framework for handling inconsistency in changing ontologies. In Proceedings of the 4th International Semantic Web Conference (ISWC’05), Galway, Ireland, November 6-10,2005, volume 3729 of Lecture Notes in Computer Science, pages 353–367. Springer. [14] Jan Hladik and Rafael Pe˜naloza. (2006). PSPACE automata for description logics. In Proceedings of the 2006 International Workshop on Description Logics (DL’06), Windermere, Lake District, UK, May 30 - June 1, 2006., volume 189 of CEUR Workshop Proceedings. CEUR-WS.org. [15] Ian Horrocks, Ulrike Sattler, and Stephan Tobies. (2000). Reasoning with individuals for the description logic SHIQ. In Proceedings of the 17th International Conference on Automated Deduction (CADE’00), Pittsburgh, PA, USA, June 17-20, 2000., volume 1831 of Lecture Notes in Computer Science, pages 482–496. Springer. [16] Zhisheng Huang, Frank van Harmelen, and Annette ten Teije. (2005). Reasoning with inconsistent ontologies. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI’05), Edinburgh, Scotland, UK, July 30-August 5, 2005, pages 454–459. Professional Book Center. [17] Anthony Hunter. (2000). Reasoning with contradictory information using quasi-classical logic. Journal of Logic and Computation, 10(5):677–703. [18] Aditya Kalyanpur, Bijan Parsia, Matthew Horridge, and Evren Sirin. (2007). Finding all justifications of OWL DL entailments. In Proceedings of the 6th International Semantic Web Conference/ the 2nd Asian Semantic Web Conference (ISWC’07 / ASWC’07), Busan, Korea, November 11-15, 2007., volume 4825 of Lecture Notes in Computer Science, pages 267–280. Springer. [19] Richard E. Ladner. (1977). The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing,, 6(3):467–480. [20] Yue Ma, Pascal Hitzler, and Zuoquan Lin. (2007). Algorithms for paraconsistent reasoning with OWL. In Proceedings of the 4th European Semantic Web Conference(ESWC’07), Innsbruck, Austria, June 3-7, 2007, volume 4519 of Lecture Notes in Computer Science, pages 399–413. Springer. [21] Yue Ma, Pascal Hitzler, and Zuoquan Lin. (2007). Paraconsistent resolution for four valued description logics. In Proceedings of the 20th International Workshop on Description Logics (DL’07), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8-10 June, 2007, volume 250 of CEUR Workshop Proceedings. CEUR-WS.org. [22] Yue Ma, Pascal Hitzler, and Zuoquan Lin. (2008). Paraconsistent reasoning for expressive and tractable description logics. In Proceedings of the 21st International Workshop on Description Logics (DL’08), Dresden, Germany, May 13-16, 2008, volume 353 of CEUR Workshop Proceedings. CEUR-WS.org. [23] Sergei P. Odintsov and Heinrich Wansing. (2008). Inconsistency-tolerant description logic. part ii: A tableau algorithm for CACLc. Journal of Applied Logic, 6(3):343–360. [24] Peter F. Patel-Schneider. (1989). A four-valued semantics for terminological logics. Artificial Intelligence, 38(3):319–351. [25] Guilin Qi and Jianfeng Du. (2009). Model-based revision operators for terminologies in description logics. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI’09), California, USA, July 11-17, 2009., pages 891–897. [26] Guilin Qi, Peter Haase, Zhisheng Huang, Qiu Ji, Jeff Z. Pan, and Johanna V¨olker. (2008). A kernel revision operator for terminologies - algorithms and evaluation. In Proceedings of the 7th International Semantic Web Conference (ISWC’08), Karlsruhe, Germany, October 26-30, 2008., volume 5318 of Lecture Notes in Computer Science, pages 419–434. Springer. [27] Guilin Qi, Weiru Liu, and David A. Bell. (2006). A revision-based approach to handling inconsistency in description logics. Artificial Intelligence Review, 26(1-2):115–128. [28] Guilin Qi, Jeff Z. Pan, and Qiu Ji. (2007). Extending description logics with uncertainty reasoning in possibilistic logic. In Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’07), Hammamet, Tunisia, October 31 - November 2, 2007, volume 4724 of Lecture Notes in Computer Science, pages 828–839. Springer. [29] Klaus Schild. (1991). A correspondence theory for terminological logics: Preliminary report. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI’91), Sydney, Australia, August 24-30, 1991., pages 466–471. Morgan Kaufmann. [30] Stefan Schlobach and Ronald Cornet. (2003). Non-standard reasoning services for the debugging of description logic terminologies. In Proceedings of the 18th International Joint Conference on Artificial Intelligence(IJCAI’03), Acapulco, Mexico, August 9-15, 2003, pages 355–362. Morgan Kaufmann. [31] Manfred Schmidt-Schauß and Gert Smolka. (1991). Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1–26. [32] Umberto Straccia. (1997). A four-valued fuzzy propositional logic. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI’97), Nagoya, Japan, August 23-29, 1997., pages 128–135. Morgan Kaufmann. [33] Umberto Straccia. (1997). A sequent calculus for reasoning in four-valued description logics. In Proceedings of the 6th International Conference of Automated Reasoning with Analytic Tableaux and Related Methods, (TABLEAUX’97), Pont-`a-Mousson, France, May 13-16, 1997, volume 1227 of Lecture Notes in Computer Science, pages 343–357. Springer. [34] Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors. (2007). Handbook of Knowledge Representation (Foundations of Artificial Intelligence). Elsevier Science. [35] Xiaowang Zhang and Zuoquan Lin. (2008). Paraconsistent reasoning with quasi-classical semantics in ALC. In Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems (RR’08), Karlsruhe, Germany, October 31-November 1, 2008., volume 5341 of Lecture Notes in Computer Science, pages 222–229. Springer. [36] Xiaowang Zhang, Guilin Qi, Yue Ma, and Zuoquan Lin. (2009). Quasi-classical semantics for expressive description logics. In Proceedings of the 22nd International Workshop on Description Logics (DL’09), Oxford, UK, July 27-30,2009., volume 477 of CEUR Workshop Proceedings. CEUR-WS.org. [37] Xiaowang Zhang, Zhihu Zhang, and Zuoquan Lin. (2009). An argumentative semantics for paraconsistent reasoning in description logic ALC. In Proceedings of the 22nd International Workshop on Description Logics (DL’09), Oxford, United Kindgom, July 27-30, 2009., volume 353 of CEUR Workshop Proceedings. CEUR-WS.org. [38] Xiaowang Zhang, Zhihu Zhang, Dai Xu, and Zuoquan Lin. (2010). Argumentation-based reasoning with inconsistent knowledge bases. In Proceedings of the 23rd Canadian Conference on Artificial Intelligence (Canadian AI’10), Ottawa, Canada, May 31 - June 2, 2010., volume 6085 of Lecture Notes in Computer Science, pages 87–99. Springer. | - |
| local.type.refereed | Refereed | - |
| local.type.specified | Article | - |
| dc.identifier.isi | 000301082300005 | - |
| dc.identifier.url | http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-18-number-3-4-2012/mvlsc-18-3-4-p-291-327/ | - |
| item.fulltext | With Fulltext | - |
| item.contributor | ZHANG, Xiaowang | - |
| item.contributor | LIN, Zuoquan | - |
| item.accessRights | Open Access | - |
| item.fullcitation | ZHANG, Xiaowang & LIN, Zuoquan (2012) Quasi-classical description logic. In: JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 18 (3-4), p. 291-327. | - |
| crisitem.journal.issn | 1542-3980 | - |
| crisitem.journal.eissn | 1542-3999 | - |
| Appears in Collections: | Research publications | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| QCALC.pdf | Peer-reviewed author version | 382.21 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
5
checked on Apr 24, 2024
Page view(s)
12
checked on Sep 7, 2022
Download(s)
4
checked on Sep 7, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.