26 citations · 26 across the 3 of their papers we have counts for
3 papers
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…
Open Answer Set Programming with Guarded Programs
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants. We define a fixed…