Double Horn functions
type: Item
instance of: scholarly article
title: Double Horn functions
zbMATH Open document ID: 0912.06011
author: Thomas Eiter
author: Toshihide Ibaraki
author: Kazuhisa Makino
published in: Information and Computation
publication date: 1999-05-16T00:00:00Z
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 1221125
zbMATH Keywords: disjunctive normal forms
zbMATH Keywords: double Horn functions
zbMATH Keywords: computational properties
zbMATH Keywords: partially defined Boolean functions
zbMATH Keywords: polynomnial-time algorithms
describes a project that uses: Datalog
MaRDI profile type: Publication
full work available at URL: inco.1998.2713
OpenAlex ID: W1965189594
cites work: Occam's razor
cites work: Error-free and best-fit extensions of partially defined Boolean functions
cites work: Q3491589
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Structure identification in relational data
cites work: Generating Boolean \(\mu\)-expressions
cites work: Q4370203
cites work: Horn functions and submodular Boolean functions
cites work: Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
cites work: Q4198056
cites work: Preferential Arrangements
cites work: Q4120519
cites work: Q4695825
cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation
cites work: Horn functions and their DNFs
cites work: On sentences which are true of direct unions of algebras
cites work: The Complexity of Very Simple Boolean Formulas with Applications
cites work: On generating all maximal independent sets
cites work: Combinatorial characterization of read-once formulae
cites work: Horn approximations of empirical data
cites work: Q4268444
cites work: Q4871262
cites work: Q4057549
cites work: Why Horn formulas matter in computer science: initial structures and generic examples
cites work: The decision problem for some classes of sentences without quantifiers
cites work: Functions computed by monotone Boolean formulas with no repeated variables
cites work: Computational limitations on learning from examples
cites work: A Way to Simplify Truth Functions
cites work: Q3268317
cites work: A theory of the learnable
cites work: Q3762226
DOI: 10.1006/INCO.1998.2713
description: scientific article; zbMATH DE number 1221125