Propositional abduction with implicit hitting sets

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

13 Citations (Scopus)


Logic-based abduction finds important applications in artificial intelligence and related areas. One application example is in finding explanations for observed phenomena. Propositional abduction is a restriction of abduction to the propositional domain, and complexity-wise is in the second level of the polynomial hierarchy. Recent work has shown that exploiting implicit hitting sets and propositional satisfiability (SAT) solvers provides an efficient approach for propositional abduction. This paper investigates this earlier work and proposes a number of algorithmic improvements. These improvements are shown to yield exponential reductions in the number of SAT solver calls. More importantly, the experimental results show significant performance improvements compared to the the best approaches for propositional abduction.

Original languageEnglish
Title of host publicationECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August–2 September 2016, The Hague, The Netherlands
Subtitle of host publicationIncluding - Prestigious Applications of Artificial Intelligence (PAIS 2016), Proceedings
EditorsGal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hullermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen
Place of PublicationAmsterdam Netherlands
PublisherIOS Press
Number of pages9
ISBN (Electronic)9781614996712
ISBN (Print)9781614996712
Publication statusPublished - 2016
Externally publishedYes
EventEuropean Conference on Artificial Intelligence 2016 - The Hague, Netherlands
Duration: 29 Aug 20162 Sep 2016
Conference number: 22nd

Publication series

NameFrontiers in Artificial Intelligence and Applications
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314


ConferenceEuropean Conference on Artificial Intelligence 2016
Abbreviated titleECAI 2016
CityThe Hague
Internet address

Cite this