On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts

Authors

  • Philippe Besnard IRIT, Université Paul Sabatier
  • Eric Grégoire CRIL
  • Jean-Marie Lagniez CRIL, Artois University

DOI:

https://doi.org/10.1609/aaai.v29i1.9751

Keywords:

Partial-max-SAT, SAT, MSS, Maximal Satisfiable Subset

Abstract

An original method for the extraction of one maximal subset of a set of Boolean clauses that must be satisfiable with possibly mutually contradictory assumptive contexts is motivated and experimented. Noticeably, it performs a direct computation and avoids the enumeration of all subsets that are satisfiable with at least one of the contexts. The method applies for subsets that are maximal with respect to inclusion or cardinality.

AAAI 2015 Proceedings Cover

Downloads

Published

2015-03-04

How to Cite

Besnard, P., Grégoire, E., & Lagniez, J.-M. (2015). On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9751

Issue

Vol. 29 No. 1 (2015): Twenty-Ninth AAAI Conference on Artificial Intelligence

Section

Main Track: Search and Constraint Satisfaction