We define a collection of map**s that transform many-valued clausal forms into
satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them …

Let me begin with a brief discussion of the name of this chapter: the adjective “advanced” in
the title can only be understood in the temporal sense; the bulk of Urquhart's chapter in this …

Like in the case of classical logic and other non-standard logics, a variety of complexity-
related questions can be asked in the context of many-valued logic. Some questions, such …

Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a
generalised notion of literal, called signed literal. A signed literal is an expression of the form …

One aspect that has been poorly studied in multiple-valued logics, and in particular in
Łukasiewicz logic, is the generation of instances of varying difficulty for evaluating …

In this paper we first define a reduction/spl delta/that transforms an instance/spl Gamma/of
Regular-SAT into a satisfiability equivalent instance/spl Gamma//sup/spl delta//of SAT. The …

In this paper we investigate phase transitions in the random 3-SAT problem but we move
from the usual setting of classical logic to the more general setting of multiple-valued logics …

Propositional product logic belongs to the basic fuzzy logics with continuous t-norms using
the product t-norm (defined as the ordinary product of real numbers) on the unit interval [0 …

In this paper we describe new local search algorithms for regular CNF formulas and
investigate their suitability for solving problems from the domains of graph coloring and …

We provide the foundations of automated deduction in the propositional Gδdel logic. The
propositional Gδdel logic is one of the simplest infinitely valued fuzzy logics, which …