CfP special issue of Journal of Automated Reasoning (JAR) on Automated Reasoning Systems

The past few decades have seen major developments and practical achievements in automated reasoning systems. For example, SAT solving has become an inherent part of the standard hardware production process; SMT solvers are now the backbone of most software verification techniques; first-order theorem provers have pushed the productivity of interactive theorem proving to a new level; computer algebra systems have solved difficult problems in mathematics and biology; knowledge representation systems have become indispensable for reasoning in the world wide web; automatic termination checkers routinely prove the termination of complex programs.

This special issue is dedicated to automated reasoning systems in their full variety, along the dimensions of considered logic, considered problem, application area and user base. In particular, we welcome papers emphasizing engineering aspects because, while often crucial for the success of automated reasoning tools, they are typically not given a sufficiently detailed treatment in theory papers or system description papers published at conferences or workshops.