Constraint solving has been successfully employed in diverse areas such as Operation Research, Planning, Logic Programming, and Automated Deduction. This has led to the development of a number of specialised approaches as well as to the adoption of different integration schemes and methodologies. In this paper we introduce an approach to incorporate constraint solving in term rewriting and we compare it with the Constraint Logic Programming scheme. We compare the two approaches both at the theoretical and at the implementational level and discuss potentials for cross-fertilisation.
Constraint solving in logic programming and in automated deduction: A comparison / Armando, A.; Melis, E.; Ranise, S.. - 1480:(1998), pp. 28-38. (Intervento presentato al convegno 8th International Conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 1998 tenutosi a Sozopol, bgr nel 1998) [10.1007/bfb0057432].
Constraint solving in logic programming and in automated deduction: A comparison
Ranise S.
1998-01-01
Abstract
Constraint solving has been successfully employed in diverse areas such as Operation Research, Planning, Logic Programming, and Automated Deduction. This has led to the development of a number of specialised approaches as well as to the adoption of different integration schemes and methodologies. In this paper we introduce an approach to incorporate constraint solving in term rewriting and we compare it with the Constraint Logic Programming scheme. We compare the two approaches both at the theoretical and at the implementational level and discuss potentials for cross-fertilisation.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
