Efficient reasoning for inconsistent Horn formulae
From MaRDI portal
(Redirected from Publication:2835881)
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A theory of diagnosis from first principles
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
- Computing maximal autarkies with few and simple oracle queries
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- Horn clause solvers for program verification
- Investigations on autark assignments
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- MCS Extraction with Sublinear Oracle Queries
- NP-completeness: a retrospective
- On generating all maximal independent sets
- On sentences which are true of direct unions of algebras
- On the query complexity of selecting minimal sets for monotone predicates
- On the use of autarkies for satisfiability decision
- Redundancy in logic. I: CNF propositional formulae
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- Resolution-based lower bounds in MaxSAT
- Solving satisfiability in less than \(2^ n\) steps
- The complexity of logic-based abduction
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Towards efficient MUS extraction
- Unification as a complexity measure for logic programming
- Unit Refutations and Horn Sets
Cited in
(7)- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- On Tackling Explanation Redundancy in Decision Trees
- On the complexity of inconsistency measurement
- An efficient algorithm for Horn description
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Sensitivity analysis for Horn formulae
- From simplification to a partial theory solver for non-linear real polynomial constraints
This page was built for publication: Efficient reasoning for inconsistent Horn formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835881)
