Pages that link to "Item:Q1575175"
From MaRDI portal
The following pages link to Semantical and computational aspects of Horn approximations (Q1575175):
Displaying 20 items.
- Belief revision within fragments of propositional logic (Q386044) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- A semantics for complex objects and approximate answers (Q1176289) (← links)
- Sensitivity analysis for Horn formulae (Q1200328) (← links)
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951) (← links)
- Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow (Q1356203) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- Pseudo-models and propositional Horn inference (Q1766742) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- Propositional lower bounds: Algorithms and complexity (Q1978032) (← links)
- The universe of propositional approximations (Q2369011) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Belief Update Within Propositional Fragments (Q3451174) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- (Q4040341) (← links)
- (Q4205425) (← links)
- (Q4812982) (← links)