Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Computations with Finite Closure Systems and Implications
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Boolean Functions
Fundamental study: The multiple facets of the canonical direct unit implicational basis
Theoretical Computer Science
On implicational bases of closure systems with unique critical sets
Discrete Applied Mathematics
| Hi-index | 0.04 |
The closure system on a finite set is a unifying concept in logic programming, relational databases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by defining the D-basis and introducing the concept of an ordered direct basis of an implicational system. A direct basis of a closure operator, or an implicational system, is a set of implications that allows one to compute the closure of an arbitrary set by a single iteration. This property is preserved by the D-basis at the cost of following a prescribed order in which implications will be attended. In particular, using an ordered direct basis allows to optimize the forward chaining procedure in logic programming that uses the Horn fragment of propositional logic. One can extract the D-basis from any direct unit basis @S in time polynomial in the size s(@S), and it takes only linear time of the cardinality of the D-basis to put it into a proper order. We produce examples of closure systems on a 6-element set, for which the canonical basis of Duquenne and Guigues is not ordered direct.