Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
0912.3134
Cited By
v1
v2
v3
v4 (latest)
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
16 December 2009
N. Creignou
Johannes Schmidt
Michael Thomas
TPM
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Complexity of Propositional Abduction for Restricted Sets of Boolean Functions"
3 / 3 papers shown
Complexity of Faceted Explanations in Propositional Abduction
Theory and Practice of Logic Programming (TPLP), 2025
Johannes Schmidt
Mohamed Maizia
Victor Lagerkvist
Johannes Fichte
216
1
0
20 Jul 2025
On the Complexity of Finding Second-Best Abductive Explanations
International Journal of Approximate Reasoning (IJAR), 2012
P. Liberatore
M. Schaerf
289
5
0
26 Apr 2012
Complexity of Non-Monotonic Logics
Michael Thomas
H. Vollmer
LRM
228
12
0
10 Sep 2010
1
Page 1 of 1
