Pseudo-models and propositional Horn inference
From MaRDI portal
Publication:1766742
DOI10.1016/j.dam.2004.06.019zbMath1123.03009OpenAlexW1990183750MaRDI QIDQ1766742
Rüdiger Krauße, Bernhard Ganter
Publication date: 8 March 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.06.019
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Closure-based constraints in formal concept analysis ⋮ Closure spaces that are not uniquely generated
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attribute exploration with background knowledge
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- A theory of finite closure spaces based on implications
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
This page was built for publication: Pseudo-models and propositional Horn inference
