<?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-06-27T12:26:13Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/57725" metadataPrefix="qdc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/57725</identifier><datestamp>2023-08-25T10:28:28Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>A higher-order logic programming language with constraints</dc:title>
   <dc:creator>Nieva Soto, Susana</dc:creator>
   <dc:creator>Leach Albert, Javier</dc:creator>
   <dcterms:abstract>We present a framework for the combination of Constraint Logic Programming (tiCLP) and higher-order Hereditary Harrop Formulas (tihoHH). Our aim is to improve the expressiveness of traditional Logic Programming with the benefits of both fields: tiCLP and tihoHH. The result is denoted higher-order Hereditary Harrop Formulas with Constraints (hoHH(C)). The syntax of hoHH is introduced using lambda-terms and is enriched with a basic constraint system. Then an intuitionistic sequent calculus is defined for this combined logic, that preserves the property of an abstract logic programming language. In addition, a sound and complete procedure for goal solving is presented as a transformation system that explains the operational semantics.</dcterms:abstract>
   <dcterms:dateAccepted>2023-06-20T17:04:20Z</dcterms:dateAccepted>
   <dcterms:available>2023-06-20T17:04:20Z</dcterms:available>
   <dcterms:created>2023-06-20T17:04:20Z</dcterms:created>
   <dcterms:issued>2001</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/57725</dc:identifier>
   <dc:identifier>0302-9743</dc:identifier>
   <dc:language>spa</dc:language>
   <dc:relation>98-0445-C03-02</dc:relation>
   <dc:rights>restricted access</dc:rights>
   <dc:publisher>Springer Verlag</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>