On the Parameterized Complexity of Associative and Commutative Unification.

Tatsuya Akutsu Takeyuki Tamura Atsuhiro Takasu

Published in: CoRR (2013)

Keyphrases

parameterized complexity
fixed parameter tractable
theorem proving
global constraints
special case
np hard
computational problems
information extraction
theorem prover
automated reasoning
symmetry breaking
abstract argumentation