Journal of Automated Reasoning

Numerical errors are insidious, difficult to predict and inherent in different levels of critical systems design. Indeed, numerical algorithms generally constitute approximations of an ideal mathematical model, which itself constitutes an ...

We present a formalization of several fundamental notions and results from Quantum Information theory in the proof assistant Isabelle/HOL, including density matrices and projective measurements, along with the proof that the local hidden-variable ...

We present an automatic theorem prover for projective incidence geometry. This prover does not consider coordinates. Instead, it follows a combinatorial approach based on the concept of rank. This allows to deal only with sets of points and to ...

In this paper, we define two particular forms of non-termination, namely loops and binary chains, in an abstract framework that encompasses term rewriting and logic programming. The definition of loops relies on the notion of compatibility of ...

Quantified conflict-driven clause learning (QCDCL) is one of the main solving approaches for quantified Boolean formulas (QBF). One of the differences between QCDCL and propositional CDCL is that QCDCL typically follows the prefix order of the QBF ...${\mathsf{}}^{\mathsf{}\mathsf{}}$${\mathsf{}}^{\mathsf{}\mathsf{}\mathsf{}\mathsf{}}$${\mathsf{}}^{\mathsf{}\mathsf{}\mathsf{}\mathsf{}}$${\mathsf{}}^{\mathsf{}\mathsf{}\mathsf{}\mathsf{}}$$\mathsf{}$${\mathsf{}}^{\mathsf{}\mathsf{}\mathsf{}\mathsf{}}$$\mathsf{}$