Ltur
From MaRDI portal
Software:23629
No author found.
Related Items (38)
On Tackling Explanation Redundancy in Decision Trees ⋮ Properties of SLUR Formulae ⋮ Unnamed Item ⋮ Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing ⋮ SAT-Based Horn Least Upper Bounds ⋮ The unique Horn-satisfiability problem and quadratic Boolean equations. ⋮ Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR ⋮ Polynomial-time inference of all valid implications for Horn and related formulae ⋮ Branch-and-cut solution of inference problems in propositional logic ⋮ Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems ⋮ Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing ⋮ Unnamed Item ⋮ Extended Horn sets in propositional logic ⋮ A decomposition method for CNF minimality proofs ⋮ Abstract Hilbertian deductive systems, infon logic, and Datalog ⋮ A CNF Class Generalizing Exact Linear Formulas ⋮ Design and implementation of aggregate functions in the DLV system ⋮ Complexity Classifications of Boolean Constraint Satisfaction Problems ⋮ Theory and Applications of Satisfiability Testing ⋮ Hydras: complexity on general graphs and a subclass of trees ⋮ About some UP-based polynomial fragments of SAT ⋮ Horn functions and their DNFs ⋮ On the complexity of propositional knowledge base revision, updates, and counterfactuals ⋮ Hardness results for approximate pure Horn CNF formulae minimization ⋮ A subclass of Horn CNFs optimally compressible in polynomial time ⋮ Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data ⋮ Generalized domination in closure systems ⋮ Bounded treewidth as a key to tractability of knowledge representation and reasoning ⋮ Satisfiability of mixed Horn formulas ⋮ Algorithms for Variable-Weighted 2-SAT and Dual Problems ⋮ Inferring minimal functional dependencies in Horn and q-Horn theories ⋮ BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies ⋮ From simplification to a partial theory solver for non-linear real polynomial constraints ⋮ Sorting, linear time and the satisfiability problem ⋮ Efficient Reasoning for Inconsistent Horn Formulae ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas ⋮ A variant of Reiter's hitting-set algorithm ⋮ On functional dependencies in \(q\)-Horn theories
This page was built for software: Ltur
