A DECISION-PROCESS FOR THE SATISFIABILITY PROBLEM IN A UNIVERSE OF HEREDITARILY FINITE SETS

Authors
HIBTI M LEGEARD B LOMBARDI H
Citation
M. Hibti et al., A DECISION-PROCESS FOR THE SATISFIABILITY PROBLEM IN A UNIVERSE OF HEREDITARILY FINITE SETS, Informatique theorique et applications, 31(3), 1997, pp. 205-236
Citations number
36
Categorie Soggetti
Computer Sciences","Computer Science Information Systems
Journal title
Informatique theorique et applications → ACNP
ISSN journal
09883754
Volume
31
Issue
3
Year of publication
1997
Pages
205 - 236
Database
ISI
SICI code
0988-3754(1997)31:3<205:ADFTSP>2.0.ZU;2-9
Abstract
In this paper we deal with the satisfiability problem for systems of c onstraints over hereditarily finite sets. This problem is central for integrating sets in programming languages, and particularly for constr aint logic programming languages. The approach we propose here is base d on reducing systems of set constraints into systems of linear intege r equalities and inequalities (with bounded domain). The complexity of the reduction is on O(n(3)).