Bidual Horn functions and extensions
type: Item
instance of: scholarly article
title: Bidual Horn functions and extensions
zbMATH Open document ID: 0941.68152
DOI: 10.1016/S0166-218X(99)00033-5
author: Thomas Eiter
author: Toshihide Ibaraki
author: Kazuhisa Makino
published in: Discrete Applied Mathematics
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1389864
zbMATH Keywords: partially defined Boolean functions
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Queries and concept learning
cites work: Learning conjunctions of Horn clauses
cites work: Minimal Representation of Directed Hypergraphs
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: Decomposability of partially defined Boolean functions
cites work: Error-free and best-fit extensions of partially defined Boolean functions
cites work: Q3491589
cites work: Structure identification in relational data
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems
cites work: Double Horn functions
cites work: Horn functions and submodular Boolean functions
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Q4198056
cites work: Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
cites work: Horn functions and their DNFs
cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation
cites work: Unification as a complexity measure for logic programming
cites work: On generating all maximal independent sets
cites work: Horn approximations of empirical data
cites work: Q4268444
cites work: Q4871262
cites work: Minimum Covers in Relational Database Model
cites work: Horn Extensions of a Partially Defined Boolean Function
cites work: Positive and Horn decomposability of partially defined Boolean functions
cites work: A Way to Simplify Truth Functions
cites work: A theory of the learnable
cites work: Q3762226
full work available at URL: s0166-218x(99)00033-5
OpenAlex ID: W2092197458
Recommended article: Q5481354
Recommended article: Recognition and dualization of disguised bidual Horn functions.
Recommended article: Q4381405
Recommended article: Double Horn functions
Recommended article: Horn Extensions of a Partially Defined Boolean Function
Recommended article: Relations for the Horn functions
Recommended article: Bipolynomial Hilbert functions
Recommended article: Biquaternion extensions of analytic functions
Recommended article: On renamable Horn and generalized Horn functions
Recommended article: Horn functions and their DNFs
description: scientific article; zbMATH DE number 1389864