37 citations · 80 across the 29 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.LO2010
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Nadia Creignou, Arne Meier, Michael Thomas +1
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore 1985 for mod…
cs.LO2010★ 4 cited
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
Arne Meier, Thomas Schneider
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Se…