Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...