Autark assignments of Horn CNFs
type: Item
instance of: scholarly article
title: Autark assignments of Horn CNFs
zbMATH Open document ID: 1390.68599
author: Kei Kimura
author: Kazuhisa Makino
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2018-04-12T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6859026
zbMATH Keywords: Boolean satisfiability problem
zbMATH Keywords: autark assignment
zbMATH Keywords: Horn CNF
zbMATH Keywords: combinatorial algorithm
describes a project that uses: JBool
MaRDI profile type: Publication
full work available at URL: s13160-017-0284-6
OpenAlex ID: W2780854972
cites work: Q5503674
cites work: Some results and experiments in programming techniques for propositional logic
cites work: Polynomial-time inference of all valid implications for Horn and related formulae
cites work: Q4255462
cites work: Q3077976
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Unit Refutations and Horn Sets
cites work: Investigations on autark assignments
cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
cites work: Renaming a Set of Clauses as a Horn Set
cites work: Introduction to Mathematics of Satisfiability
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: Parallel cooperative propositional theorem proving
cites work: A short note on some tractable cases of the satisfiability problem.
DOI: 10.1007/S13160-017-0284-6
Recommended article: Automating induction for solving Horn clauses
Recommended article: On a generalization of Horn constraint systems
Recommended article: Compactly generating all satisfying truth assignments of a Horn formula
Recommended article: Q3384902
Recommended article: Tree Automata-Based Refinement with Application to Horn Clause Verification
Recommended article: Horn Clause Solvers for Program Verification
Recommended article: Hardness results for approximate pure Horn CNF formulae minimization
Recommended article: HORNLOG: A graph-based interpreter for general Horn clauses
Recommended article: Q5015366
description: scientific article; zbMATH DE number 6859026