Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Linear stochastic systems
Short proofs of the pigeonhole formulas based on the connection method
Journal of Automated Reasoning
COCOLOG: A Conditional Observer and Controller Logic for Finite Machines
SIAM Journal on Control and Optimization
On Markovian Fragments of COCOLOG for Logic Control Systems
SIAM Journal on Control and Optimization
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Logic for Problem Solving
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
| Hi-index | 0.00 |
The Conditional Observer and Controller Logic (COCOLOG) is a logical system for the feedback control of finite input‐state‐output systems wherein the individual first order logical theories have the properties of consistency, completeness and decidability. The efficiency of automatic theorem proving (ATP) is a crucial issue in the implementation of COCOLOG control systems and in this paper we present a so‐called function evaluation (FE) based resolution‐refutation ATP methodology for COCOLOG. FE‐resolution ATP replaces the axioms specifying the dynamics of a finite input‐state‐output machine by a set of defined function relations. The resulting procedure extends to predicates and hence permits the definition of constant and variable FE‐resolution inference. It is shown that FE‐resolution ATP is complete in the sense that a set of clauses which is unsatisfiable in all models with the given interpretation of the functions will yield the empty clause under resolution, paramodulation and FE‐resolution.