An algorithm to compute maximal contractions for Horn clauses
From MaRDI portal
Publication:543196
DOI10.1007/S11432-010-4172-9zbMATH Open1229.03015OpenAlexW2031621466MaRDI QIDQ543196FDOQ543196
Publication date: 17 June 2011
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4172-9
Recommendations
- A maximal-literal unit strategy for horn clauses
- On the complexity of the maximum satisfiability problem for Horn formulas
- scientific article; zbMATH DE number 3892614
- Publication:4729408
- scientific article; zbMATH DE number 4085614
- An algorithm for enumerating maximal models of Horn theories with an application to modal logics
- Solving constrained Horn clauses using dependence-disjoint expansions
- On a generalization of Horn constraint systems
- Automated Deduction – CADE-20
- A combinatorial algorithm for Horn programs
Logics of knowledge and belief (including belief change) (03B42) Mechanization of proofs and logical operations (03B35)
Cites Work
Cited In (13)
- Enumerating Minimally Revised Specifications Using Dualization
- A representative model based algorithm for maximal contractions
- Logical verification of scientific discovery
- An efficient algorithm for Horn description
- Decidable subsets of open logic and an algorithm for R-calculus
- A linear algorithm for renaming a set of clauses as a Horn set
- On anti-subsumptive knowledge enforcement
- Efficient reasoning for inconsistent Horn formulae
- Maximal contractions in Boolean algebras
- A general framework for computing maximal contractions
- A decomposition based algorithm for maximal contractions
- Algorithms for Computing Minimal Conflicts
- Consistent subsets of inconsistent systems: structure and behaviour
This page was built for publication: An algorithm to compute maximal contractions for Horn clauses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543196)