A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Repairing inconsistent answer set programs using rules of thumb: A gene regulatory networks case study
2017
International Journal of Approximate Reasoning
Answer set programming is a form of declarative programming that can be used to elegantly model various systems. When the available knowledge about these systems is imperfect, however, the resulting programs can be inconsistent. In such cases, it is of interest to find plausible repairs, i.e. plausible modifications to the original program that ensure the existence of at least one answer set. Although several approaches to this end have already been proposed, most of them merely find a repair
doi:10.1016/j.ijar.2017.01.012
fatcat:qu2mxo4ohfdhxczzjcl6oo3yoq