Pages that link to "Item:Q1089797"
From MaRDI portal
The following pages link to Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797):
Displaying 15 items.
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Data exchange: semantics and query answering (Q555772) (← links)
- The meaning of specifications I: Domains and initial models (Q673181) (← links)
- Data types over multiple-valued logics (Q752687) (← links)
- Specifications in an arbitrary institution (Q1108775) (← links)
- Syntactic characterization of closure under connected limits (Q1210580) (← links)
- Double Horn functions (Q1271644) (← links)
- Unique complements and decompositions of database schemata (Q1318468) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- On the existence of free models in fuzzy universal Horn classes (Q2410497) (← links)
- A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases (Q2946749) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- Algebraic Characterizations for Universal Fragments of Logic (Q4264538) (← links)
- Exploiting data dependencies in many-valued logics (Q4868234) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
