The complexity of minimum partial truth assignments and implication in negation-free formulae

DOI10.1007/BF02136174zbMATH Open0891.68110OpenAlexW2005967372MaRDI QIDQ1380416FDOQ1380416

James Delgrande, Arvind Kumar Gupta

Publication date: 19 July 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02136174

zbMATH Keywords

symbolic reasoning

Mathematics Subject Classification ID

Knowledge representation (68T30) Classical first-order logic (03B10)

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?)
• The complexity of satisfiability problems
• The complexity of theorem-proving procedures
• On the Complexity of Timetable and Multicommodity Flow Problems
• Title not available (Why is that?)
• Circumscription - a form of non-monotonic reasoning
• An \(O(EV\log^2V)\) algorithm for the maximal flow problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the computational complexity of the pure classical implication calculus
• A decidable first-order logic for knowledge representation

Cited In (1)

• On the fixed-parameter tractability of the equivalence test of monotone normal forms

   Recommendations

• Two results in negation-free logic 👍 👎
• The complexity of minimal satisfiability problems 👍 👎
• The complexity of propositional implication 👍 👎
• The minimum equivalent DNF problem and shortest implicants 👍 👎

This page was built for publication: The complexity of minimum partial truth assignments and implication in negation-free formulae

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380416)