Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Artificial Intelligence

arXiv:cs/0506074 (cs)
[Submitted on 17 Jun 2005 (v1), last revised 21 Jun 2005 (this version, v3)]

Title:Redundancy in Logic II: 2CNF and Horn Propositional Formulae

Authors:Paolo Liberatore
View PDF
Abstract: We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of cyclicity proved to be relevant to the complexity of these problems. Some results about Horn formulae are also shown.
Comments: Corrected figures on Theorem 10; added and modified some references
Subjects: Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO)
Cite as: arXiv:cs/0506074 [cs.AI]
  (or arXiv:cs/0506074v3 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.cs/0506074
Related DOI: https://doi.org/10.1016/j.artint.2007.06.003

Submission history

From: Paolo Liberatore [view email]
[v1] Fri, 17 Jun 2005 19:28:29 UTC (211 KB)
[v2] Mon, 20 Jun 2005 15:07:15 UTC (226 KB)
[v3] Tue, 21 Jun 2005 14:16:22 UTC (224 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
view license
Current browse context:
cs.AI
< prev   |   next >
new | recent | 2005-06

References & Citations

DBLP - CS Bibliography

listing | bibtex
Paolo Liberatore
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)