A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms

• Autorzy: Dovier, A. , Policriti, A. , Rossi, G.
• Języki publikacji: EN

Abstrakty

EN

The first-order theories of lists, multisets, compact lists (i.e., lists, where the number of contiguous occurrences of each element is immaterial) , and sets are introduced via axioms. Such axiomatizations are shown to be very well-suited for the integration with free functor symbols governed by the classical Clark's axioms in the context of (Constraint) Logic Programming. Adaptations of the extensionally principle to the various theories taken into account is then exploited in the design of unification algorithms for the considered data structures. All the theories presented can be combined providing frameworks to deal with several of the proposed data structures simultaneously. The unification algorithms proposed can be combined (merged) as well, to produce engines for such combination theories.

Słowa kluczowe

EN

axiomatic set theory; unification

• Czasopismo: Fundamenta Informaticae
• Rocznik: 1998
• Tom: Vol. 36, nr 2,3
• Strony: 201-234
• Opis fizyczny: bibliogr. 27 poz.

Twórcy

autor

Dovier, A.

autor

Policriti, A.

autor

Rossi, G.

• Dipartimento Scientifico-Tecnologico, Universita di Verona, Strada Le Grazie, 37134, Verona, Italy,