swMATH11689MaRDI QIDQ23629FDOQ23629
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/002001908890124X
Cited In (53)
- A decomposition method for CNF minimality proofs
- Abstract Hilbertian deductive systems, infon logic, and Datalog
- A CNF Class Generalizing Exact Linear Formulas
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Title not available (Why is that?)
- Satisfiability of mixed Horn formulas
- A subclass of Horn CNFs optimally compressible in polynomial time
- The unique Horn-satisfiability problem and quadratic Boolean equations.
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Inferring minimal functional dependencies in Horn and q-Horn theories
- Algorithms for Variable-Weighted 2-SAT and Dual Problems
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
- Theory and Applications of Satisfiability Testing
- Horn functions and their DNFs
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
- Polynomial-time inference of all valid implications for Horn and related formulae
- On functional dependencies in \(q\)-Horn theories
- On Tackling Explanation Redundancy in Decision Trees
- Properties of SLUR Formulae
- Hardness results for approximate pure Horn CNF formulae minimization
- Generalized domination in closure systems
- JBool
- Branch-and-cut solution of inference problems in propositional logic
- CEL
- Leibniz
- BEACON
- Just
- A variant of Reiter's hitting-set algorithm
- Datalog
- DKAL
- Lixto
- Hornlog
- DIADEM
- EL2MCS
- Datalog LITE
- Complexity classifications of Boolean constraint satisfaction problems
- Extended Horn sets in propositional logic
- HgMUS
- Sorting, linear time and the satisfiability problem
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
- Efficient reasoning for inconsistent Horn formulae
- Linear time Datalog and branching time logic
- ITI
- MediBoost
- Design and implementation of aggregate functions in the DLV system
- SAT-Based Horn Least Upper Bounds
- Hydras: complexity on general graphs and a subclass of trees
- About some UP-based polynomial fragments of SAT
- From simplification to a partial theory solver for non-linear real polynomial constraints
- Logic, languages, and rules for web data extraction and reasoning over data
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
This page was built for software: Ltur
