Semantical and computational aspects of Horn approximations
From MaRDI portal
Recommendations
Cites work
- Circumscription - a form of non-monotonic reasoning
- Horn approximations of empirical data
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1303023 (Why is no real title available?)
- scientific article; zbMATH DE number 1354130 (Why is no real title available?)
- scientific article; zbMATH DE number 1149451 (Why is no real title available?)
- scientific article; zbMATH DE number 3185223 (Why is no real title available?)
- Knowledge compilation and theory approximation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- On computing minimal models
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Reasoning with models
- Semantical and computational aspects of Horn approximations
- The complexity of selecting maximal solutions
Cited in
(25)- An efficient algorithm for Horn description
- A semantics for complex objects and approximate answers
- Sensitivity analysis for Horn formulae
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
- Is intractability of nonmonotonic reasoning a real drawback?
- Semantical and computational aspects of Horn approximations
- Pseudo-models and propositional Horn inference
- Tractable reasoning via approximation
- Propositional lower bounds: Algorithms and complexity
- The universe of propositional approximations
- First order LUB approximations: characterization and algorithms
- Efficient reasoning for inconsistent Horn formulae
- Horn upper bounds and renaming
- Belief update within propositional fragments
- SAT-Based Horn Least Upper Bounds
- Horn Upper Bounds and Renaming
- scientific article; zbMATH DE number 3968568 (Why is no real title available?)
- Belief revision within fragments of propositional logic
- scientific article; zbMATH DE number 193539 (Why is no real title available?)
- scientific article; zbMATH DE number 4125378 (Why is no real title available?)
- scientific article; zbMATH DE number 2086980 (Why is no real title available?)
- scientific article; zbMATH DE number 2090546 (Why is no real title available?)
- A compositional semantic basis for the analysis of equational Horn programs
- Information loss in knowledge compilation: a comparison of Boolean envelopes
This page was built for publication: Semantical and computational aspects of Horn approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575175)
