• Aucun résultat trouvé

The SATisfiability problem and its impact

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "The SATisfiability problem and its impact"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

The SATisfiability problem and its impact

Agostino Dovier

Dept. of Mathematics, Computer Science, and Physics, University of Udine

[email protected]

Abstract. The tutorial will deal with the problem of establishing the satisfiability of a propositional logical formula (in short, SAT). Its im- portance will be investigated both theoretically and practically.

As far as the importance in theoretical computer science and mathemat- ics are concerned, the role of SAT in the P-vs-NP problem (one among the 7 Millennium Problems listed by the Clay Mathematics Institute) will be clarified.

On the practical side, a brief history of the main computational tech- niques for solving it will be presented. The impact of SAT in real life applications will be highlighted by showing that any NP problem can be reduced to it, and therefore, worked out by exploiting the efficiency of modern SAT solvers.

The talk will be concluded by recalling a logic programming language with the same expressivity of SAT.

Références

Télécharger maintenant ( PDF - 1 Page - 117.07 KB )

Documents relatifs

Cartesian and statistical approches of the satisfiability problem

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

A SOLUTION OF THE 4 TH CLAY MILLENNIUM PROBLEM ABOUT THE NAVIER-STOKES EQUATIONS

Such a more general form of the solution of the Poisson equations as in MAJDA, A.J- BERTOZZI, A. 2002 §1.9.2 Lemma 1.12 pp 38, and in particular when smooth bounded input

THE SOLUTIONS OF THE 3 RD AND 4 TH CLAY MILLENNIUM PROBLEMS

The next are a list of well know necessary and sufficient conditions , for regularity (global in time existence and smoothness) of the solutions of Euler and Navier-Stokes

ON THE SOLUTION OF THE 3 RD CLAY MILLENNIUM PROBLEM. A SHORT AND ELEGANT PROOF THAT P ≠ NP IN THE CONTEXT OF DETERMINISTIC TURING MACHINES AND ZERMELO- FRANKEL SET THEORY

It is important to understand that such an (non-Archimedean) algebraic structure of complexity measures may be partially ordered rather than linearly or totally ordered

On the 4th Clay millennium problem: Proof of the regularity of the solutions of the Euler and Navier-Stokes equations, based on the conservation of particles

The study believes that the main reasons of the failure so far in proving of the 3D global regularity of incompressible flows, with reasonably smooth initial conditions like

The complexity of the Pk partition problem and related problems in bipartite graphs

Concerning the approximability of related problems, Hassin and Rubinstein, [9] pro- posed a generic algorithm to approximate MaxW P 4 Packing in complete graphs on 4n vertices

Study of the NP-completeness of the compact table problem

We would like to point out that the Compact Table of order ℓ problem with a limited number of possible results becomes trivial (solvable in constant time), because with a limited

The complexity of the Pk partition problem and related problems in bipartite graphs

This paper is organized as follows: in the next section, we will briefly present previous related work about the hardness of solving bounded-size-path packing problems; then, the