Pages that link to "Item:Q5805954"
From MaRDI portal
The following pages link to On sentences which are true of direct unions of algebras (Q5805954):
Displayed 50 items.
- Complexity versus stability for classes of propositional formulas (Q293437) (← links)
- Belief revision within fragments of propositional logic (Q386044) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Minimal change: relevance and recovery revisited (Q490421) (← links)
- RSS query algebra: towards a better news management (Q497199) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- A language for generic programming in the large (Q532409) (← links)
- A systematic study of models of abstract data types (Q801667) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
- The multiple facets of the canonical direct unit implicational basis (Q974107) (← links)
- Proof theory for linear lattices (Q1070254) (← links)
- Dynamic algebras: Examples, constructions, applications (Q1189900) (← links)
- Double Horn functions (Q1271644) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Sequent calculus for classical logic probabilized (Q1712933) (← links)
- Special issue: Boolean functions and related problems (Q1841878) (← links)
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions (Q1841879) (← links)
- A method for the synthesis of deducibility conditions for Horn and some other formulas (Q1847304) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- Forward chaining is simple\((x)\) (Q1970424) (← links)
- The ubiquitous axiom (Q2038868) (← links)
- Inference approach based on Petri nets (Q2056355) (← links)
- The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
- Complexity of the problem of being equivalent to Horn formulas (Q2145867) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- On propositional definability (Q2389643) (← links)
- A representation of antimatroids by Horn rules and its application to educational systems (Q2403022) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- Reasoning with models (Q2676579) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Characterizability in Horn Belief Revision (Q2835894) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- On Arithmetical Classes Not Closed Under Direct Union (Q3230364) (← links)
- Properties preserved under algebraic constructions (Q3257768) (← links)
- On closure under direct product (Q3267403) (← links)
- (Q3384905) (← links)
- Belief Update Within Propositional Fragments (Q3451174) (← links)
- Canonical Inference for Implicational Systems (Q3541718) (← links)
- Horn representation of a concept lattice (Q3631392) (← links)
- Über die Axiome Produkt-Abgeschlossener Arithmetischer Klassen (Q3843612) (← links)
- On generating all solutions of generalized satisfiability problems (Q4389761) (← links)
- (Q4580320) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)