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