The complexity of Boolean functions
The complexity of Boolean functions
Annual review of computer science: vol. 3, 1988
An algorithm to compute circumscription
Artificial Intelligence
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Characterizing diagnoses and systems
Artificial Intelligence
Linear resolution for consequence finding
Artificial Intelligence
On generalized Horn formulas and k-resolution
Theoretical Computer Science
Logical features of Horn Clauses
Handbook of logic in artificial intelligence and logic programming (vol. 1)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Horn approximations of empirical data
Artificial Intelligence
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Support set selection for abductive and default reasoning
Artificial Intelligence
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Semantical and computational aspects of Horn approximations
Artificial Intelligence
On strongest neccessary and weakest sufficient conditions
Artificial Intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Extending abduction from propositional to first-order logic
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Minimal Answer Computation and SOL
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The Complexity of Restricted Consequence Finding and Abduction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A General Framework for Knowledge Compilation
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
A survey on knowledge compilation
AI Communications
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Model-based diagnosis using structured system descriptions
Journal of Artificial Intelligence Research
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Practical partition-based theorem proving for large knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Approximate knowledge compilation: the first order case
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Learning to assign degrees of belief in relational domains
Machine Learning
Approximation of Ontologies in CASL
Proceedings of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006)
Hi-index | 0.00 |
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced by Selman and Kautz (1991, 1996). In this paper, we address the problem of lowest upper bound (LUB) approximation in a general setting. We characterize LUB approximations for arbitrary target languages, both propositional and first order, and describe algorithms of varying generality and efficiency for all target languages, proving their correctness. We also examine some aspects of the computational complexity of the algorithms, both propositional and first order; show that they can be used to characterize properties of whole families of resolution procedures; discuss the quality of approximations; and relate LUB approximations to other approaches existing in the literature which are not typically seen in the approximation framework, and which go beyond the "knowledge compilation" perspective that led to the introduction of LUBs.