Semantical and computational aspects of Horn approximations
type: Item
instance of: scholarly article
title: Semantical and computational aspects of Horn approximations
zbMATH Open document ID: 0945.68160
DOI: 10.1016/S0004-3702(00)00010-2
published in: Artificial Intelligence
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 1493164
zbMATH Keywords: knowledge compilation
zbMATH Keywords: knowledge approximation
zbMATH Keywords: computational complexity
zbMATH Keywords: Horn formulae
author: Marco Cadoli
author: Francesco Scarcello
MaRDI profile type: Publication
cites work: On computing minimal models
cites work: The complexity of selecting maximal solutions
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: Q4249522
cites work: Q5721424
cites work: Q4386975
cites work: Horn approximations of empirical data
cites work: Q4268444
cites work: Reasoning with models
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3221403
cites work: Knowledge compilation and theory approximation
Wikidata QID: Q127442714
description: scientific article; zbMATH DE number 1493164