Semantic relevance
From MaRDI portal
Publication:2104509
DOI10.1007/978-3-031-10769-6_13OpenAlexW4289104023MaRDI QIDQ2104509
Christoph Weidenbach, Fajar Haifani
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_13
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of facets (and some facets of complexity)
- The complexity of facets resolved
- Quantifying conflicts in propositional logic through prime implicates
- Investigations on autark assignments
- Generalized completeness for SOS resolution and its application to a new notion of relevance
- On computing the union of MUSes
- Redundancy in logic. I: CNF propositional formulae
- Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
- Axiom Pinpointing in General Tableaux
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
- The complexity of logic-based abduction
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- A Machine-Oriented Logic Based on the Resolution Principle
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
This page was built for publication: Semantic relevance
