We present an executable formally verified SAT encoding of ground classical AI planning problems. use the theorem prover Isabelle/HOL to perform verification. experimentally test and show that it can be used for reasonably sized standard benchmarks. also as a reference state-of-the-art SAT-based planner, showing sometimes falsely claims problems have no solutions certain lengths.

The principal topic of this article is to extend Shanks' infrastructure ideas in real quadratic number elds to the case of real quadratic congruence function elds. In this view, this paper is intended as a \low-brow" approach to the theory of ideals and operations in the ideal class group. We summarize some basic properties of ideals and provide elementary proofs of the main results. For the pu...

Let Sn = K[[x1, . . . , xn]] be the algebra of power series over a field K of characteristic zero, S c n be the group of continuous automorphisms of Sn with constant Jacobian, and Div c n be the Lie algebra of derivations of Sn with constant divergence. We prove that AutLie(Div c n) = AutLie,c(Div c n) ≃ S c n.