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

Philippe Besnard, Éric Grégoire, Jean-Marie Lagniez

AAAI 2015 pp. 3710-3716

doi:10.1609/AAAI.V29I1.9751 /aaai/2015/besnard2015aaai-computing/

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.

PDF AAAI Semantic Scholar

Cite

Text

Besnard et al. "On Computing Maximal Subsets of Clauses That Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9751

Markdown

[Besnard et al. "On Computing Maximal Subsets of Clauses That Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/besnard2015aaai-computing/) doi:10.1609/AAAI.V29I1.9751

BibTeX

@inproceedings{besnard2015aaai-computing,
  title     = {{On Computing Maximal Subsets of Clauses That Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts}},
  author    = {Besnard, Philippe and Grégoire, Éric and Lagniez, Jean-Marie},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {3710-3716},
  doi       = {10.1609/AAAI.V29I1.9751},
  url       = {https://mlanthology.org/aaai/2015/besnard2015aaai-computing/}
}