Common equivalence and size of forgetting from Horn formulae
From MaRDI portal
Publication:6661056
DOI10.1007/S10472-024-09955-5MaRDI QIDQ6661056
Publication date: 10 January 2025
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Logics of knowledge and belief (including belief change) (03B42) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Succinctness in dependency systems
- Forgetting for knowledge bases in DL-lite
- The complexity of Boolean formula minimization
- Answer set programming based on propositional satisfiability
- Uniform interpolation and propositional quantifiers in modal logics
- Reasoning under inconsistency: a forgetting-based approach
- Knowledge forgetting: properties and applications
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- The polynomial-time hierarchy
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- The minimum equivalent DNF problem and shortest implicants
- Preprocessing of intractable problems
- On the automatizability of resolution and related propositional proof systems
- The size of a revised knowledge base
- On the limits of forgetting in answer set programming
- Probably approximately correct learning of Horn envelopes from queries
- Forgetting in multi-agent modal logics
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Semantic forgetting in answer set programming
- Solving logic program conflict through strong and weak forgettings
- Relationships between nondeterministic and deterministic tape complexities
- Uniform Interpolation of $\mathcal{ALC}$ -Ontologies Using Fixpoints
- Horn clause contraction functions
- Forgetting for Defeasible Logic
- Preserving Strong Equivalence while Forgetting
- On the restricted equivalence for subclasses of propositional logic
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- On Approximate Horn Formula Minimization
- On the Structure of Armstrong Relations for Functional Dependencies
- Polynomial size proofs of the propositional pigeonhole principle
- Two-level logic minimization: an overview
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- A Knowledge Level Account of Forgetting
- A Syntactic Operator for Forgetting that Satisfies Strong Persistence
- Revisiting Graph Width Measures for CNF-Encodings
- Enumeration of the Elementary Circuits of a Directed Graph
- Belief Change
- Knowledge Forgetting in Answer Set Programming
- Complexity of Default Logic on Generalized Conjunctive Queries
- Forgetting Literals with Varying Propositional Symbols
- An extension of the Craig-Lyndon interpolation theorem
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
This page was built for publication: Common equivalence and size of forgetting from Horn formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661056)