Talks and Poster Presentations (with Proceedings-Entry):

A. Pfandler, E. Sallinger:
"Distance-Bounded Consistent Query Answering";
Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 07-25-2015 - 07-31-2015; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 2262 - 2269.

English 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.

Electronic version of the publication:

Related Projects:
Project Head Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen

Project Head Reinhard Pichler:
Heterogene Information Integration

Project Head Reinhard Pichler:
SEE: SPARQL Evaluation and Extensions

Project Head Stefan Woltran:

Created from the Publication Database of the Vienna University of Technology.