Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.147 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A preference meta-model for logic programs with possibilistic ordered disjunction

Thumbnail
View/Open
19-33.pdf (663,3Kb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/14215

Show full item record
Confalonieri, Roberto
Nieves Sánchez, Juan Carlos
Vázquez Salceda, JavierMés informacióMés informacióMés informació
Document typeConference report
Defense date2009
PublisherCEUR Workshop Proceedings
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
This paper presents an approach for specifying user preferences related to services by means of a preference meta-model, which is mapped to logic programs with possibilistic ordered disjunction following a Model-Driven Methodology (MDM). MDM allows to specify problem domains by means of meta-models which can be converted to instance models or other meta-models through transformation functions. In particular we propose a preference meta-model that defines an abstract preference specification language allowing users to specify preferences in a more friendly way using models. We also present a meta-model for logic programs with possibilistic order disjunction. Then we show how we conceptually map the preference meta-model to logic programs with possibilistic ordered disjunction by means of a mapping function.
CitationConfalonieri, R.; NIEVES, J. C.; Vazquez-Salceda, J. A preference meta-model for logic programs with possibilistic ordered disjunction. A: International Workshop Software Engineering for Answer Set Programming. "Second International Workshop Software Engineering for Answer Set Programming". Potsdam: CEUR Workshop Proceedings, 2009, p. 19-33. 
URIhttp://hdl.handle.net/2117/14215
Publisher versionhttp://ceur-ws.org/Vol-546/19-33.pdf
Collections
  • Departament de Ciències de la Computació - Ponències/Comunicacions de congressos [1.330]
  • KEMLG - Grup d'Enginyeria del Coneixement i Aprenentatge Automàtic - Ponències/Comunicacions de congressos [110]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
19-33.pdf663,3KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina