# Set constraint

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- J. Heuristics
- 2008

Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems… (More)

Is this relevant?

2006

2006

- Constraints
- 2006

In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Constraint… (More)

Is this relevant?

2005

2005

- J. Artif. Intell. Res.
- 2005

Constraint solvers typically maintain a domain of possible values for each variable that may form part of a solution to a… (More)

Is this relevant?

2000

2000

- 2000

1 {fa,pb}@di.fct.unl.pt Departamento de Informática, Universidade Nova de Lisboa 2825-114 Caparica — Portugal Abstract. In this… (More)

Is this relevant?

Review

1999

Review

1999

- Sci. Comput. Program.
- 1999

Program analysis is concerned with automatically extracting information from programs. Program analysis is a large topic, with a… (More)

Is this relevant?

1997

1997

- CP
- 1997

Set constraints is a suitable formalism for static analysis of programs. However, it is known that the complexity of set… (More)

Is this relevant?

1995

1995

- 1995

An interesting diierence between Datalog P(Z) and Datalog < Z is that the former is DEXPTIME-hard even if the size of each… (More)

Is this relevant?

1994

1994

- CCL
- 1994

Set constraints are relations between sets of ground terms over a given alphabet. They give a natural formalism for many problems… (More)

Is this relevant?

1993

1993

- 1993

domains employed in abstract interpretation are typically required to satisfy the finite ascending chains condition (or some… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- 1992

The central component of standard approaches to compile-time program analysis is an abstract domain for approximating program… (More)

Is this relevant?