13,785 research outputs found

    Solving stable matching problems using answer set programming

    Get PDF
    Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for finding the stable matchings. To address this issue, we propose an encoding of the SMP using answer set programming (ASP), which can straightforwardly be adapted and extended to suit the needs of specific applications. The use of ASP also means that we can take advantage of highly efficient off-the-shelf solvers. To illustrate the flexibility of our approach, we show how our ASP encoding naturally allows us to select optimal stable matchings, i.e. matchings that are optimal according to some user-specified criterion. To the best of our knowledge, our encoding offers the first exact implementation to find sex-equal, minimum regret, egalitarian or maximum cardinality stable matchings for SMP instances in which individuals may designate unacceptable partners and ties between preferences are allowed. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).Comment: Under consideration in Theory and Practice of Logic Programming (TPLP). arXiv admin note: substantial text overlap with arXiv:1302.725

    Modeling Stable Matching Problems with Answer Set Programming

    Get PDF
    The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when individuals may designate unacceptable partners and ties between preferences are allowed. Subsequently, we show how our ASP based encoding naturally allows us to select specific stable matchings which are optimal according to a given criterion. Each time, we can rely on generic and efficient off-the-shelf answer set solvers to find (optimal) stable matchings.Comment: 26 page

    Web Queries: From a Web of Data to a Semantic Web?

    Get PDF

    Four Lessons in Versatility or How Query Languages Adapt to the Web

    Get PDF
    Exposing not only human-centered information, but machine-processable data on the Web is one of the commonalities of recent Web trends. It has enabled a new kind of applications and businesses where the data is used in ways not foreseen by the data providers. Yet this exposition has fractured the Web into islands of data, each in different Web formats: Some providers choose XML, others RDF, again others JSON or OWL, for their data, even in similar domains. This fracturing stifles innovation as application builders have to cope not only with one Web stack (e.g., XML technology) but with several ones, each of considerable complexity. With Xcerpt we have developed a rule- and pattern based query language that aims to give shield application builders from much of this complexity: In a single query language XML and RDF data can be accessed, processed, combined, and re-published. Though the need for combined access to XML and RDF data has been recognized in previous work (including the W3C’s GRDDL), our approach differs in four main aspects: (1) We provide a single language (rather than two separate or embedded languages), thus minimizing the conceptual overhead of dealing with disparate data formats. (2) Both the declarative (logic-based) and the operational semantics are unified in that they apply for querying XML and RDF in the same way. (3) We show that the resulting query language can be implemented reusing traditional database technology, if desirable. Nevertheless, we also give a unified evaluation approach based on interval labelings of graphs that is at least as fast as existing approaches for tree-shaped XML data, yet provides linear time and space querying also for many RDF graphs. We believe that Web query languages are the right tool for declarative data access in Web applications and that Xcerpt is a significant step towards a more convenient, yet highly efficient data access in a “Web of Data”

    Identification of Public Objectives Related to Agricultural Sector Support

    Get PDF
    The Common Agricultural Policy (CAP) is a widely debated policy in terms of both its budget and its instruments. In order to serve the citizens of Europe properly, CAP requires optimal identification of the public objectives desired. This paper aims to analyse the relative weights that citizens assign to the various potential objectives of the CAP and to show how these can be used to improve the selection of policy instruments. As a means of identifying social preferences we used the Analytical Hierarchy Process (AHP) technique on a population sample in Castilla y LeĂłn (Spain). Results show how the current policy decision process lacks mechanisms capable of identifying social preferences and thus leading to the choice of sub-optimal policies.Common Agricultural Policy, Objectives, Social preferences, AHP, Castilla y LeĂłn.

    GIS-based multicriteria analysis as decision support in flood risk management

    Get PDF
    In this report we develop a GIS-based multicriteria flood risk assessment and mapping approach. This approach has the ability a) to consider also flood risks which are not measured in monetary terms, b) to show the spatial distribution of these multiple risks and c) to deal with uncertainties in criteria values and to show their influence on the overall assessment. It can furthermore be used to show the spatial distribution of the effects of risk reduction measures. The approach is tested for a pilot study at the River Mulde in Saxony, Germany. Therefore, a GISdataset of economic as well as social and environmental risk criteria is built up. Two multicriteria decision rules, a disjunctive approach and an additive weighting approach are used to come to an overall assessment and mapping of flood risk in the area. Both the risk calculation and mapping of single criteria as well as the multicriteria analysis are supported by a software tool (FloodCalc) which was developed for this task. --
    • 

    corecore