{"type":"ScholarlyArticle","title":"Distance-Bounded Consistent Query Answering","authors":[{"name":"Andreas Pfandler","slug":"andreas-pfandler","given":"Andreas","family":"Pfandler","affiliation":""},{"name":"Emanuel Sallinger","slug":"emanuel-sallinger","given":"Emanuel","family":"Sallinger","affiliation":""}],"abstract":"The ability to perform reasoning on inconsistent data is a central problem both for AI and database research. One approach to deal with this situation is consistent query answering, where queries are answered over all possible repairs of the database. In general, the repair may be very distant from the original database. In this work we present a new approach where this distance is bounded and analyze its computational complexity. Our results show that in many (but not all) cases the complexity drops.","doi":null,"url":"https://ijcai.org/proceedings/2015/320","pdf":"https://ijcai.org/proceedings/2015/0320.pdf","markdown":"https://ijcai.org/proceedings/2015/320.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/320","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Web and Knowledge-Based Information Systems","track":"Main Track","number":320,"pages":{"first":2262,"last":2268},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}