Compactly generating all satisfying truth assignments of a Horn formula
From MaRDI portal
Publication:2786908
zbMath1348.68233arXiv1012.1769MaRDI QIDQ2786908
Publication date: 23 February 2016
Full work available at URL: https://arxiv.org/abs/1012.1769
Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Compressed representation of learning spaces ⋮ Compression with wildcards: Abstract simplicial complexes ⋮ Counting or producing all fixed cardinality transversals ⋮ Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function
This page was built for publication: Compactly generating all satisfying truth assignments of a Horn formula
