Solving stable matching problems using answer set programming

DOI10.1017/S147106841600003XzbMath1379.68280arXiv1512.05247MaRDI QIDQ4593026

Steven Schockaert, Martine De Cock, Ann Nowé, Sofie De Clercq

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.05247

zbMATH Keywords

stable marriage problemanswer set programmingoptimal stable matchingslogic rules

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Matching models (91B68)

Related Items (2)

Three-sided stable matching problem with two of them as cooperative partners ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Sex-equal stable matchings: complexity and exact algorithms
• Pairwise kidney exchange
• Some remarks on the stable matching problem
• Stable marriage and indifference
• A theory of nonmonotonic rule systems I
• Hard variants of stable marriage.
• On the computational cost of disjunctive logic programming: Propositional case
• Three-sided stable matchings with cyclic preferences
• The cycle roommates problem: a hard case of kidney exchange
• Approximation algorithms for the sex-equal stable marriage problem
• Three-Dimensional Stabl Matching Problems
• Design and implementation of aggregate functions in the DLV system
• Three Fast Algorithms for Four Problems in Stable Marriage
• An argumentation-theoretic foundation for logic programming
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Tight logic programs
• Algorithmics of Matching Under Preferences
• College Admissions and the Stability of Marriage

This page was built for publication: Solving stable matching problems using answer set programming