This book is the first to combine coverage of fuzzy logic and Semantic Web languages. It
provides in-depth insight into fuzzy Semantic Web languages for non-fuzzy set theory and …

Motivated by the performance improvements made to SAT solvers in recent years, a number
of different encodings of constraints into SAT have been proposed. Concrete examples are …

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

In this paper we consider Description Logics (DLs), which are logics for managing structured
knowledge, with a well-known fuzzy extension to deal with vague information. While for …

The implementation of effective reasoning tools for deciding the satisfiability of Quantified
Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many …

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 …

Much excitement has been generated by the recent success of stochastic local search
procedures at finding satisfying assignments to large formulas. Many of the problems on …

The Sequence constraint is useful in modelling car sequencing, rostering, scheduling and
related problems. We introduce half a dozen new encodings of the Sequence constraint …

This paper is an overview of a variety of results, all centered around a common theme,
namely embedding of non-classical logics into first order logic and resolution theorem …

Satisfiability testing (SAT) is used to solve many academic and industrial problems from the
complexity class NP, for example hardware verification or scheduling [1]. The described …