A Human Oriented Logic for Automatic Theorem-Proving

Logic Control via Automatic Theorem Proving :

The COCOLOG system is a partially ordered family of rst order logical theories that describe the controlled evolution of the state of a given partially observered nite machine M. Following the review of the general theory of COCOLOG, the notion of Markovian fragments MTh k ,k 1, of full COCOLOG theories Th k is presented. These fragments enjoy the property of having axiom set of xed size over t...

Logic for Computer Science: Foundations of Automatic Theorem Proving

Logic Programming and Theorem Proving

This paper presents a new system, called the A-System, performing abductive reasoning within theframework of Abductive Logic Programming. It isbased on a hybrid computational model that imple-ments the abductive search in terms of two tightlycoupled processes: a reduction process of the high-level logical representation to a lower-level con-straint store and a lo...

Theorem-Proving for Discrete Temporal Logic

This chapter considers theorem proving for discrete temporal logics. We are interested in deciding or at least enumerating the formulas of the logic which are valid, that is, are true in all circumstances. Most of the techniques for temporal theorem-proving have been extensions for methods developed for classical logics but completely novel techniques have also been developed. Initially we conc...

Automatic Theorem Proving in Walnut

2 Basics 3 2.1 Words and Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Number Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Automatic Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...