Principles of artificial intelligence
Principles of artificial intelligence
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
P-Functions and Boolean Matrix Factorization: A Unified Approach for Wired, Programmed and Microprogrammed Implementations of Discrete Algorithms
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Digital Systems with Algorithm Implementation
Digital Systems with Algorithm Implementation
TABLOG: The deductive-tableau programming language
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Synthesis and Optimization of Programs by Means of P-Functions
IEEE Transactions on Computers
A Matrix Formalism for Asynchronous Implementation of Algorithms
IEEE Transactions on Computers
IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
IEEE Transactions on Computers
| Hi-index | 14.98 |
This paper shows that synthesizing binary decision programs (formed by means of decision instructions of the type if then else and of execution instructions of the type do) and proving theorems can be carried out by using the same approach. It is proved that the same transformations acting on P-functions can be interpreted in terms of binary program synthesis and of theorem proving. Since binary program leads to algorithmic state machine design while theorem proving leads to declarative programming, this allows us to lay a bridge between logic design and declarative languages such as Prolog.