Skip to Main content Skip to Navigation
New interface
Conference papers

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

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.
Document type :
Conference papers
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03300455
Contributor : Fabien DELORME Connect in order to contact the contributor
Submitted on : Tuesday, July 27, 2021 - 10:19:16 AM
Last modification on : Friday, November 25, 2022 - 4:06:56 AM

Links full text

Identifiers

Citation

Philippe Besnard, Éric Grégoire, Jean-Marie Lagniez. On Computing Maximal Subsets of Clauses that Must Be Satisfiable with Possibly Mutually-Contradictory Assumptive Contexts. 29th AAAI Conference on Artificial Intelligence (AAAI'15), 2015, Austin, Texas, United States. pp.3710-3716, ⟨10.1609/aaai.v29i1.9751⟩. ⟨hal-03300455⟩

Share

Metrics

Record views

7