<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-28T06:43:51Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/29689" metadataPrefix="mods">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/29689</identifier><datestamp>2026-02-03T10:55:05Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><mods:mods xmlns:doc="http://www.lyncode.com/xoai" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Cordero-Ortega, Pablo</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Enciso-García-Oliveros, Manuel</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Mora-Bonilla, Ángel</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Vychodil, Vilem</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2024-02-02T09:45:10Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2024-02-02T09:45:10Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">2020</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="citation">Pablo Cordero, Manuel Enciso, Angel Mora &amp; Vilem Vychodil (2020) Parameterized simplification logic I: reasoning with implications and classes of closure operators, International Journal of General Systems, 49:7, 724-746, DOI: 10.1080/03081079.2020.1831484</mods:identifier>
   <mods:identifier type="uri">https://hdl.handle.net/10630/29689</mods:identifier>
   <mods:identifier type="doi">10.1080/03081079.2020.1831484</mods:identifier>
   <mods:abstract>In this paper, we present a general inference system for reasoning with if-then rules. They are defined using general lattice-theoretic notions and their semantics is defined using particular closure operators parameterized by systems of isotone Galois connections. In this general setting, we introduce a simplification logic, show its sound and complete axiomatization, and deal with related issues. The presented results can be seen as forming parameterized framework for dealing with if-then rules that allows to focus on particular dependencies obtained by choices of parameterizations.</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:subject>
      <mods:topic>Subrutinas (Programas de ordenador)</mods:topic>
   </mods:subject>
   <mods:subject>
      <mods:topic>Lógica simbólica y matemática</mods:topic>
   </mods:subject>
   <mods:titleInfo>
      <mods:title>Parameterized simplification logic I: reasoning with implications and classes of closure operators</mods:title>
   </mods:titleInfo>
   <mods:genre>journal article</mods:genre>
</mods:mods>
</metadata></record></GetRecord></OAI-PMH>