Minimal sets on propositional formulae. Problems and reductions

Artificial Intelligence 252 (C):22-50 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,297

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Redundancy in logic I: CNF propositional formulae.Paolo Liberatore - 2005 - Artificial Intelligence 163 (2):203-232.
Redundancy in logic II: 2CNF and Horn propositional formulae.Paolo Liberatore - 2008 - Artificial Intelligence 172 (2-3):265-299.
Propositional belief base update and minimal change.Andreas Herzig & Omar Rifi - 1999 - Artificial Intelligence 115 (1):107-138.

Analytics

Added to PP
2020-12-22

Downloads
15 (#1,104,030)

6 months
10 (#592,147)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

A theory of diagnosis from first principles.Raymond Reiter - 1987 - Artificial Intelligence 32 (1):57-95.
SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
Redundancy in logic I: CNF propositional formulae.Paolo Liberatore - 2005 - Artificial Intelligence 163 (2):203-232.
Optimizing with minimum satisfiability.Chu Min Li, Zhu Zhu, Felip Manyà & Laurent Simon - 2012 - Artificial Intelligence 190 (C):32-44.

View all 11 references / Add more references