First order LUB approximations: characterization and algorithms

DOI10.1016/J.ARTINT.2004.01.003MaRDI QIDQ2457687zbMATH OpenOpenAlexFDO

Authors Alvaro del Val

Publication date 23 October 2007

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2004.01.003

zbMATH Keywords

approximationfirst-order logicautomated reasoningreformulationknowledge compilationresolution theorem proving

Mathematics Subject Classification ID

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

Recommendations

• SAT-Based Horn Least Upper Bounds
• scientific article; zbMATH DE number 2086980
• Semantical and computational aspects of Horn approximations
• scientific article; zbMATH DE number 1841825
• Tractable reasoning via approximation

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 500950 (Why is no real title available?)
• scientific article; zbMATH DE number 534879 (Why is no real title available?)
• scientific article; zbMATH DE number 1168533 (Why is no real title available?)
• scientific article; zbMATH DE number 1931664 (Why is no real title available?)
• scientific article; zbMATH DE number 861622 (Why is no real title available?)
• A note on linear resolution strategies in consequence-finding
• An algorithm to compute circumscription
• An incremental method for generating prime implicants/implicates
• Characterizing diagnoses and systems
• Consequence finding algorithms
• Decomposable negation normal form
• Horn approximations of empirical data
• Knowledge compilation and theory approximation
• Linear resolution for consequence finding
• On generalized Horn formulas and k-resolution
• On strongest necessary and weakest sufficient conditions
• On the number of prime implicants
• Propositional lower bounds: Algorithms and complexity
• Semantical and computational aspects of Horn approximations
• Structure identification in relational data
• Support set selection for abductive and default reasoning

Cited in

(4)

• Information loss in knowledge compilation: a comparison of Boolean envelopes
• Learning to assign degrees of belief in relational domains
• SAT-Based Horn Least Upper Bounds
• Belief revision within fragments of propositional logic

This page was built for publication: First order LUB approximations: characterization and algorithms

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