Connection Method for Defeasible Description Logics
| Ano de defesa: | 2024 |
|---|---|
| Autor(a) principal: | |
| Orientador(a): | |
| Banca de defesa: | |
| Tipo de documento: | Tese |
| Tipo de acesso: | Acesso aberto |
| dARK ID: | ark:/64986/0013000029611 |
| Idioma: | eng |
| Instituição de defesa: |
Universidade Federal de Pernambuco
|
| Programa de Pós-Graduação: |
Programa de Pos Graduacao em Ciencia da Computacao
|
| Departamento: |
Não Informado pela instituição
|
| País: |
Brasil
|
| Palavras-chave em Português: | |
| Link de acesso: | https://repositorio.ufpe.br/handle/123456789/63946 |
Resumo: | The modelling of exceptions in ontologies, provided through defeasible logics, and the reasoning behind their presence have received significant attention in the last decade. The development of proof methods for defeasible Description Logics (DLs), following the methods for classi- cal DLs, is mainly based on semantic tableaux. However, the literature offers equally viable alternatives for developing automatic theorem provers, such as the connection method. This method consists of a goal-oriented proof search algorithm for connections (pairs of comple- mentary literals) in sets of literal clauses called a matrix. This thesis presents a connection method for a family of exception-tolerant DLs. The work presents the following contributions: (i) definition of a matrix representation of a knowledge base that establishes conditions for a given axiom to be provable by the matrix; (ii) definition of a blocking condition in the presence of typicality operators; (iii) providing a bond between the matrix structures of the proposed method and the semantics of defeasible DLs; (iv) proofs of correctness, completeness and termination for the proposed inference system, grounded only on the semantics of defeasible description logics; and (v) an architecture of polymorphic connection method provers, Poly- CoP, developed for the ALCH∙ language. Such an architecture can encompass any other logic, with subtle modifications in its methods and classes. |
| id |
UFPE_aae1dec6e36000cbb619bf477842deab |
|---|---|
| oai_identifier_str |
oai:repositorio.ufpe.br:123456789/63946 |
| network_acronym_str |
UFPE |
| network_name_str |
Repositório Institucional da UFPE |
| repository_id_str |
|
| spelling |
FERNANDES, Renan Leandrohttp://lattes.cnpq.br/4329681764449719http://lattes.cnpq.br/6195215666638965http://lattes.cnpq.br/9819688590950504FREITAS, Frederico Luiz Gonçalves deVARZINCZAK, Ivan José2025-06-26T14:07:23Z2025-06-26T14:07:23Z2024-08-30FERNANDES, Renan Leandro. Connection Method for Defeasible Description Logics. 2024. Tese (Doutorado em Ciências da Computação) – Universidade Federal de Pernambuco, Recife, 2024.https://repositorio.ufpe.br/handle/123456789/63946ark:/64986/0013000029611The modelling of exceptions in ontologies, provided through defeasible logics, and the reasoning behind their presence have received significant attention in the last decade. The development of proof methods for defeasible Description Logics (DLs), following the methods for classi- cal DLs, is mainly based on semantic tableaux. However, the literature offers equally viable alternatives for developing automatic theorem provers, such as the connection method. This method consists of a goal-oriented proof search algorithm for connections (pairs of comple- mentary literals) in sets of literal clauses called a matrix. This thesis presents a connection method for a family of exception-tolerant DLs. The work presents the following contributions: (i) definition of a matrix representation of a knowledge base that establishes conditions for a given axiom to be provable by the matrix; (ii) definition of a blocking condition in the presence of typicality operators; (iii) providing a bond between the matrix structures of the proposed method and the semantics of defeasible DLs; (iv) proofs of correctness, completeness and termination for the proposed inference system, grounded only on the semantics of defeasible description logics; and (v) an architecture of polymorphic connection method provers, Poly- CoP, developed for the ALCH∙ language. Such an architecture can encompass any other logic, with subtle modifications in its methods and classes.A modelagem de exceções em ontologias, proporcionada através do uso de lógicas anuláveis, e o raciocínio em sua presença recebeu uma significativa atenção na última década. O desen- volvimento de métodos de prova para as Lógicas de Descrições (DLs) anuláveis, seguindo os métodos para as DLs clássicas, é principalmente baseado em tableaux semânticos. No entanto, a literatura apresenta sistemas de inferência alternativos igualmente viáveis para o desenvolvi- mento de provadores de teoremas automáticos, como o método de conexões. Este método consiste em um algoritmo de busca de prova orientado a um objetivo, buscando por conexões (pares de literais complementares) em conjuntos de cláusulas de literais, chamada de matriz. Esta tese apresenta um método de conexões para uma família de DLs tolerante a exceções. O trabalho apresenta as seguintes contribuições: (i) definição de uma representação matricial de uma base de conhecimento que estabelece condições para que um dado axioma seja provado pela matriz; (ii) definição de uma condição de bloqueio na presença de operadores de tipicali- dade; (iii) fornecimento de um vínculo entre as estruturas matriciais do método proposto e a semântica de DLs anuláveis; (iv) provas de corretude, completude e terminação para o sistema de inferência proposto, dependendo apenas da semântica das lógicas de descrições anuláveis; e (v) uma arquitetura de provadores de métodos de conexões polimórficos, o PolyCoP, de- senvolvido para a linguagem ALCH∙ . Tal arquitetura pode abranger possivelmente qualquer outra lógica, com modificações sutis em seus métodos e classes.engUniversidade Federal de PernambucoPrograma de Pos Graduacao em Ciencia da ComputacaoUFPEBrasilhttps://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessConnection methodDescription logicsDefeasible reasoningConnection Method for Defeasible Description Logicsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisdoutoradoreponame:Repositório Institucional da UFPEinstname:Universidade Federal de Pernambuco (UFPE)instacron:UFPEORIGINALTESE Renan Leandro Fernandes.pdfTESE Renan Leandro Fernandes.pdfapplication/pdf1372773https://repositorio.ufpe.br/bitstream/123456789/63946/1/TESE%20Renan%20Leandro%20Fernandes.pdf3fad18683c9750f518f20768be3ee192MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-82362https://repositorio.ufpe.br/bitstream/123456789/63946/2/license.txt5e89a1613ddc8510c6576f4b23a78973MD52TEXTTESE Renan Leandro Fernandes.pdf.txtTESE Renan Leandro Fernandes.pdf.txtExtracted texttext/plain169661https://repositorio.ufpe.br/bitstream/123456789/63946/3/TESE%20Renan%20Leandro%20Fernandes.pdf.txta30ba96055bcfe5d8493854b0bbb1c21MD53THUMBNAILTESE Renan Leandro Fernandes.pdf.jpgTESE Renan Leandro Fernandes.pdf.jpgGenerated Thumbnailimage/jpeg1219https://repositorio.ufpe.br/bitstream/123456789/63946/4/TESE%20Renan%20Leandro%20Fernandes.pdf.jpg8d157e27f4f974a490f617285a6099f8MD54123456789/639462025-06-29 14:35:15.574oai:repositorio.ufpe.br:123456789/63946VGVybW8gZGUgRGVww7NzaXRvIExlZ2FsIGUgQXV0b3JpemHDp8OjbyBwYXJhIFB1YmxpY2l6YcOnw6NvIGRlIERvY3VtZW50b3Mgbm8gUmVwb3NpdMOzcmlvIERpZ2l0YWwgZGEgVUZQRQoKCkRlY2xhcm8gZXN0YXIgY2llbnRlIGRlIHF1ZSBlc3RlIFRlcm1vIGRlIERlcMOzc2l0byBMZWdhbCBlIEF1dG9yaXphw6fDo28gdGVtIG8gb2JqZXRpdm8gZGUgZGl2dWxnYcOnw6NvIGRvcyBkb2N1bWVudG9zIGRlcG9zaXRhZG9zIG5vIFJlcG9zaXTDs3JpbyBEaWdpdGFsIGRhIFVGUEUgZSBkZWNsYXJvIHF1ZToKCkkgLSBvcyBkYWRvcyBwcmVlbmNoaWRvcyBubyBmb3JtdWzDoXJpbyBkZSBkZXDDs3NpdG8gc8OjbyB2ZXJkYWRlaXJvcyBlIGF1dMOqbnRpY29zOwoKSUkgLSAgbyBjb250ZcO6ZG8gZGlzcG9uaWJpbGl6YWRvIMOpIGRlIHJlc3BvbnNhYmlsaWRhZGUgZGUgc3VhIGF1dG9yaWE7CgpJSUkgLSBvIGNvbnRlw7pkbyDDqSBvcmlnaW5hbCwgZSBzZSBvIHRyYWJhbGhvIGUvb3UgcGFsYXZyYXMgZGUgb3V0cmFzIHBlc3NvYXMgZm9yYW0gdXRpbGl6YWRvcywgZXN0YXMgZm9yYW0gZGV2aWRhbWVudGUgcmVjb25oZWNpZGFzOwoKSVYgLSBxdWFuZG8gdHJhdGFyLXNlIGRlIG9icmEgY29sZXRpdmEgKG1haXMgZGUgdW0gYXV0b3IpOiB0b2RvcyBvcyBhdXRvcmVzIGVzdMOjbyBjaWVudGVzIGRvIGRlcMOzc2l0byBlIGRlIGFjb3JkbyBjb20gZXN0ZSB0ZXJtbzsKClYgLSBxdWFuZG8gdHJhdGFyLXNlIGRlIFRyYWJhbGhvIGRlIENvbmNsdXPDo28gZGUgQ3Vyc28sIERpc3NlcnRhw6fDo28gb3UgVGVzZTogbyBhcnF1aXZvIGRlcG9zaXRhZG8gY29ycmVzcG9uZGUgw6AgdmVyc8OjbyBmaW5hbCBkbyB0cmFiYWxobzsKClZJIC0gcXVhbmRvIHRyYXRhci1zZSBkZSBUcmFiYWxobyBkZSBDb25jbHVzw6NvIGRlIEN1cnNvLCBEaXNzZXJ0YcOnw6NvIG91IFRlc2U6IGVzdG91IGNpZW50ZSBkZSBxdWUgYSBhbHRlcmHDp8OjbyBkYSBtb2RhbGlkYWRlIGRlIGFjZXNzbyBhbyBkb2N1bWVudG8gYXDDs3MgbyBkZXDDs3NpdG8gZSBhbnRlcyBkZSBmaW5kYXIgbyBwZXLDrW9kbyBkZSBlbWJhcmdvLCBxdWFuZG8gZm9yIGVzY29saGlkbyBhY2Vzc28gcmVzdHJpdG8sIHNlcsOhIHBlcm1pdGlkYSBtZWRpYW50ZSBzb2xpY2l0YcOnw6NvIGRvIChhKSBhdXRvciAoYSkgYW8gU2lzdGVtYSBJbnRlZ3JhZG8gZGUgQmlibGlvdGVjYXMgZGEgVUZQRSAoU0lCL1VGUEUpLgoKIApQYXJhIHRyYWJhbGhvcyBlbSBBY2Vzc28gQWJlcnRvOgoKTmEgcXVhbGlkYWRlIGRlIHRpdHVsYXIgZG9zIGRpcmVpdG9zIGF1dG9yYWlzIGRlIGF1dG9yIHF1ZSByZWNhZW0gc29icmUgZXN0ZSBkb2N1bWVudG8sIGZ1bmRhbWVudGFkbyBuYSBMZWkgZGUgRGlyZWl0byBBdXRvcmFsIG5vIDkuNjEwLCBkZSAxOSBkZSBmZXZlcmVpcm8gZGUgMTk5OCwgYXJ0LiAyOSwgaW5jaXNvIElJSSwgYXV0b3Jpem8gYSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkZSBQZXJuYW1idWNvIGEgZGlzcG9uaWJpbGl6YXIgZ3JhdHVpdGFtZW50ZSwgc2VtIHJlc3NhcmNpbWVudG8gZG9zIGRpcmVpdG9zIGF1dG9yYWlzLCBwYXJhIGZpbnMgZGUgbGVpdHVyYSwgaW1wcmVzc8OjbyBlL291IGRvd25sb2FkIChhcXVpc2nDp8OjbykgYXRyYXbDqXMgZG8gc2l0ZSBkbyBSZXBvc2l0w7NyaW8gRGlnaXRhbCBkYSBVRlBFIG5vIGVuZGVyZcOnbyBodHRwOi8vd3d3LnJlcG9zaXRvcmlvLnVmcGUuYnIsIGEgcGFydGlyIGRhIGRhdGEgZGUgZGVww7NzaXRvLgoKIApQYXJhIHRyYWJhbGhvcyBlbSBBY2Vzc28gUmVzdHJpdG86CgpOYSBxdWFsaWRhZGUgZGUgdGl0dWxhciBkb3MgZGlyZWl0b3MgYXV0b3JhaXMgZGUgYXV0b3IgcXVlIHJlY2FlbSBzb2JyZSBlc3RlIGRvY3VtZW50bywgZnVuZGFtZW50YWRvIG5hIExlaSBkZSBEaXJlaXRvIEF1dG9yYWwgbm8gOS42MTAgZGUgMTkgZGUgZmV2ZXJlaXJvIGRlIDE5OTgsIGFydC4gMjksIGluY2lzbyBJSUksIGF1dG9yaXpvIGEgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgUGVybmFtYnVjbyBhIGRpc3BvbmliaWxpemFyIGdyYXR1aXRhbWVudGUsIHNlbSByZXNzYXJjaW1lbnRvIGRvcyBkaXJlaXRvcyBhdXRvcmFpcywgcGFyYSBmaW5zIGRlIGxlaXR1cmEsIGltcHJlc3PDo28gZS9vdSBkb3dubG9hZCAoYXF1aXNpw6fDo28pIGF0cmF2w6lzIGRvIHNpdGUgZG8gUmVwb3NpdMOzcmlvIERpZ2l0YWwgZGEgVUZQRSBubyBlbmRlcmXDp28gaHR0cDovL3d3dy5yZXBvc2l0b3Jpby51ZnBlLmJyLCBxdWFuZG8gZmluZGFyIG8gcGVyw61vZG8gZGUgZW1iYXJnbyBjb25kaXplbnRlIGFvIHRpcG8gZGUgZG9jdW1lbnRvLCBjb25mb3JtZSBpbmRpY2FkbyBubyBjYW1wbyBEYXRhIGRlIEVtYmFyZ28uCg==Repositório InstitucionalPUBhttps://repositorio.ufpe.br/oai/requestattena@ufpe.bropendoar:22212025-06-29T17:35:15Repositório Institucional da UFPE - Universidade Federal de Pernambuco (UFPE)false |
| dc.title.pt_BR.fl_str_mv |
Connection Method for Defeasible Description Logics |
| title |
Connection Method for Defeasible Description Logics |
| spellingShingle |
Connection Method for Defeasible Description Logics FERNANDES, Renan Leandro Connection method Description logics Defeasible reasoning |
| title_short |
Connection Method for Defeasible Description Logics |
| title_full |
Connection Method for Defeasible Description Logics |
| title_fullStr |
Connection Method for Defeasible Description Logics |
| title_full_unstemmed |
Connection Method for Defeasible Description Logics |
| title_sort |
Connection Method for Defeasible Description Logics |
| author |
FERNANDES, Renan Leandro |
| author_facet |
FERNANDES, Renan Leandro |
| author_role |
author |
| dc.contributor.authorLattes.pt_BR.fl_str_mv |
http://lattes.cnpq.br/4329681764449719 |
| dc.contributor.advisorLattes.pt_BR.fl_str_mv |
http://lattes.cnpq.br/6195215666638965 |
| dc.contributor.advisor-coLattes.pt_BR.fl_str_mv |
http://lattes.cnpq.br/9819688590950504 |
| dc.contributor.author.fl_str_mv |
FERNANDES, Renan Leandro |
| dc.contributor.advisor1.fl_str_mv |
FREITAS, Frederico Luiz Gonçalves de |
| dc.contributor.advisor-co1.fl_str_mv |
VARZINCZAK, Ivan José |
| contributor_str_mv |
FREITAS, Frederico Luiz Gonçalves de VARZINCZAK, Ivan José |
| dc.subject.por.fl_str_mv |
Connection method Description logics Defeasible reasoning |
| topic |
Connection method Description logics Defeasible reasoning |
| description |
The modelling of exceptions in ontologies, provided through defeasible logics, and the reasoning behind their presence have received significant attention in the last decade. The development of proof methods for defeasible Description Logics (DLs), following the methods for classi- cal DLs, is mainly based on semantic tableaux. However, the literature offers equally viable alternatives for developing automatic theorem provers, such as the connection method. This method consists of a goal-oriented proof search algorithm for connections (pairs of comple- mentary literals) in sets of literal clauses called a matrix. This thesis presents a connection method for a family of exception-tolerant DLs. The work presents the following contributions: (i) definition of a matrix representation of a knowledge base that establishes conditions for a given axiom to be provable by the matrix; (ii) definition of a blocking condition in the presence of typicality operators; (iii) providing a bond between the matrix structures of the proposed method and the semantics of defeasible DLs; (iv) proofs of correctness, completeness and termination for the proposed inference system, grounded only on the semantics of defeasible description logics; and (v) an architecture of polymorphic connection method provers, Poly- CoP, developed for the ALCH∙ language. Such an architecture can encompass any other logic, with subtle modifications in its methods and classes. |
| publishDate |
2024 |
| dc.date.issued.fl_str_mv |
2024-08-30 |
| dc.date.accessioned.fl_str_mv |
2025-06-26T14:07:23Z |
| dc.date.available.fl_str_mv |
2025-06-26T14:07:23Z |
| dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
| format |
doctoralThesis |
| status_str |
publishedVersion |
| dc.identifier.citation.fl_str_mv |
FERNANDES, Renan Leandro. Connection Method for Defeasible Description Logics. 2024. Tese (Doutorado em Ciências da Computação) – Universidade Federal de Pernambuco, Recife, 2024. |
| dc.identifier.uri.fl_str_mv |
https://repositorio.ufpe.br/handle/123456789/63946 |
| dc.identifier.dark.fl_str_mv |
ark:/64986/0013000029611 |
| identifier_str_mv |
FERNANDES, Renan Leandro. Connection Method for Defeasible Description Logics. 2024. Tese (Doutorado em Ciências da Computação) – Universidade Federal de Pernambuco, Recife, 2024. ark:/64986/0013000029611 |
| url |
https://repositorio.ufpe.br/handle/123456789/63946 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.rights.driver.fl_str_mv |
https://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess |
| rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| eu_rights_str_mv |
openAccess |
| dc.publisher.none.fl_str_mv |
Universidade Federal de Pernambuco |
| dc.publisher.program.fl_str_mv |
Programa de Pos Graduacao em Ciencia da Computacao |
| dc.publisher.initials.fl_str_mv |
UFPE |
| dc.publisher.country.fl_str_mv |
Brasil |
| publisher.none.fl_str_mv |
Universidade Federal de Pernambuco |
| dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFPE instname:Universidade Federal de Pernambuco (UFPE) instacron:UFPE |
| instname_str |
Universidade Federal de Pernambuco (UFPE) |
| instacron_str |
UFPE |
| institution |
UFPE |
| reponame_str |
Repositório Institucional da UFPE |
| collection |
Repositório Institucional da UFPE |
| bitstream.url.fl_str_mv |
https://repositorio.ufpe.br/bitstream/123456789/63946/1/TESE%20Renan%20Leandro%20Fernandes.pdf https://repositorio.ufpe.br/bitstream/123456789/63946/2/license.txt https://repositorio.ufpe.br/bitstream/123456789/63946/3/TESE%20Renan%20Leandro%20Fernandes.pdf.txt https://repositorio.ufpe.br/bitstream/123456789/63946/4/TESE%20Renan%20Leandro%20Fernandes.pdf.jpg |
| bitstream.checksum.fl_str_mv |
3fad18683c9750f518f20768be3ee192 5e89a1613ddc8510c6576f4b23a78973 a30ba96055bcfe5d8493854b0bbb1c21 8d157e27f4f974a490f617285a6099f8 |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 |
| repository.name.fl_str_mv |
Repositório Institucional da UFPE - Universidade Federal de Pernambuco (UFPE) |
| repository.mail.fl_str_mv |
attena@ufpe.br |
| _version_ |
1866186355527122944 |