#### Filter Results:

#### Publication Year

1982

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper shows how to deene nonmonotonic logics from any classical logics L and any set X of formulas of L. In this context, the nonmonotonic inference relation`X is deened by A ` X B if every classical theorem of A B which is in X is a theorem of A. The properties of the relation`X are studied. We show, in particular, that the elementary properties… (More)

In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search techniques for finding an assignment leading to a largest renamable Horn sub-formula of a given CNF. More precisely, at each step, preference is given to variables such that when assigned… (More)

We study an algorithm for the SAT problem which is based on the Davis & Putnam procedure. The main idea is to increase the application of the unit clause rule during the search. When there is no unit clause in the set of clauses, our method tries to produce one occuring in the current subset of binary clauses. A literal deduction algorithm is implemented… (More)