37 citations · 66 across the 10 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.CC2009★ 1 cited
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Nadia Creignou, Johannes Schmidt, Michael Thomas
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observe…
cs.LO2009★ 8 cited
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
Arne Meier, Martin Mundhenk, Thomas Schneider +3
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this pa…