Towards automated first-order abduction: the cut-based approach

Traditional abduction imposes as a precondition the restriction that the background information may not derive the goal data. In first-order logic such precondition is, in general, undecidable. To avoid such problem, we present a first-order cut-based abduction method, which has KE-tableaux as its underlying inference system. This inference system allows for the automation of non-analytic proofs in a tableau setting, which permits a generalization of traditional abduction that avoids the undecidable precondition problem. After demonstrating the correctness of the method, we show how this method can be dynamically iterated in a process that leads to the construction of non-analytic first-order proofs and, in some terminating cases, to refutations as well.

Rounding of a first-order quantum phase transition to a strong-coupling critical point

We investigate the effects of quenched disorder on first-order quantum phase transitions on the example of the N-color quantum Ashkin-Teller model. By means of a strong-disorder renormalization group, we demonstrate that quenched disorder rounds the first-order quantum phase transition to a continuous one for both weak and strong coupling between the colors. In the strong-coupling case, we find a distinct type of infinite-randomness critical point characterized by additional internal degrees of freedom. We investigate its critical properties in detail and find stronger thermodynamic singularities than in the random transverse field Ising chain. We also discuss the implications for higher spatial dimensions as well as unusual aspects of our renormalization-group scheme. DOI: 10.1103/PhysRevB.86.214204