Semantical and computational aspects of Horn approximations
From MaRDI portal
Publication:1575175
DOI10.1016/S0004-3702(00)00010-2zbMath0945.68160WikidataQ127442714 ScholiaQ127442714MaRDI QIDQ1575175
Marco Cadoli, Francesco Scarcello
Publication date: 21 August 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items (8)
The universe of propositional approximations ⋮ Belief Update Within Propositional Fragments ⋮ SAT-Based Horn Least Upper Bounds ⋮ Belief revision within fragments of propositional logic ⋮ Is intractability of nonmonotonic reasoning a real drawback? ⋮ First order LUB approximations: characterization and algorithms ⋮ Semantical and computational aspects of Horn approximations ⋮ Tractable reasoning via approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Circumscription - a form of non-monotonic reasoning
- On computing minimal models
- Semantical and computational aspects of Horn approximations
- Horn approximations of empirical data
- The complexity of selecting maximal solutions
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Reasoning with models
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Knowledge compilation and theory approximation
This page was built for publication: Semantical and computational aspects of Horn approximations
