Approximation of relations by propositional formulas: Complexity and semantics

DOI10.1007/3-540-45622-8_18MaRDI QIDQ4737597zbMATH OpenFDO

Authors Bruno Zanuttini

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2371/23710242.htm

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Semantical and computational aspects of Horn approximations
• Knowledge compilation and theory approximation
• On the hardness of approximate reasoning
• Reasoning with models
• scientific article; zbMATH DE number 512816

Cited in

(9)

• The approximation of implicates and explanations
• Semantical and computational aspects of Horn approximations
• Horn approximations of empirical data
• Propositional lower bounds: Algorithms and complexity
• The universe of propositional approximations
• What makes propositional abduction tractable
• First order LUB approximations: characterization and algorithms
• Knowledge compilation and theory approximation
• Information loss in knowledge compilation: a comparison of Boolean envelopes

This page was built for publication: Approximation of relations by propositional formulas: Complexity and semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737597)