Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability)
Programming in Propositional Logic or Reductions: Back to the Roots (Satisfiability)
Parallel X-fault simulation with critical path tracing technique
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
This paper presents a method to generate characterizing definitions for finite and parameterized structures. In particular, the method is applied to generate a conjecture for the properties characterizing a special class of graphs, called superpositional graphs. The method can be used if the exact set of properties that describes a given finite structure cannot be found by pure thought but we can find the number of objects for small values of the parameter. The next step is to codify the objects as assignments to a set of propositional variables, and the candidate properties as propositional formulae, in such a way that an object satisfies the property if and only if the assignment satisfies the formula. The main idea of this method is to find models that do not fit with the current approximation of the description of the structure and stepwise refine the logical description. Finally, we "translate" the logical description into a mathematical one and prove it.