26 citations · 26 across the 3 of their papers we have counts for
3 papers
Modeling Stable Matching Problems with Answer Set Programming
Sofie De Clercq, Steven Schockaert, Martine De Cock +1
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 sinc…
Possibilistic Answer Set Programming Revisited
Kim Bauters, Steven Schockaert, Martine De Cock +1
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an appli…
Expressiveness of Communication in Answer Set Programming
Kim Bauters, Jeroen Janssen, Steven Schockaert +2
Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formali…