On sentences which are true of direct unions of algebras
By A. Horn. 1951
Subfields: Pure Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Pure Mathematics
Citations in the corpus
- Neural Logic Machines (2019, background): “In this section, we show that NLM can realize a partial set of Horn clauses (Horn, 1951) in first-order logic (FOL), up to the limit of the NLM’s depth and breadth .”
- DogOnt - Ontology Modeling for Intelligent Domotic Environments (2008, background): “SWRL is a powerful rule language based on Horn-like rules [15], that guarantees decidability in finite time.”