Abstract
This paper presents a defeasible constraint solver for the domain of linear equations, disequations and inequalities over the body of rational/real numbers. As extra requirements resulting from the incorporation of the solver into an Incremental Hierarchical Constraint Solver (IHCS) scenario we identified: a)the ability to refer to individual constraints by a label, b) the ability to report the (minimal) cause for the unsatisfiability of a set of constraints, and c) the ability to undo the effects of a formerly activated constraint.
We develop the new functionalities after starting the presentation with a general architecture for defeasible constraint solving, through a solved form algorithm that utilizes a generalized, incremental variant of the Simplex algorithm, where the domain of a variable can be restricted to an arbitrary interval. We demonstrate how generalized slacks form the basis for the computation of explanations regarding the cause of unsatisfiability and/or entailment in terms of the constraints told, and the possible deactivation of constraints as demanded by the hierarchy handler.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Backer B.de, Beringer H.: Intelligent Backtracking for CLP Languages: An Application to CLP(R), in Saraswat V. & Ueda K. (eds.), Symposion on Logic Programming, MIT Press, Cambridge, MA, pp.405–419, 1991.
A. Borning, M. Maher, A. Martingale, and M. Wilson. Constraints hierarchies and logic programming. In Levi and Martelli, editors, Logic Programming: Proceedings of the 6th International Conference, pages 149–164, Lisbon, Portugal, June 1989. The MIT Press.
Burg J., Lang S.-D., Hughes G.E.: Finding Conflict Sets and Backtrack Points in CLP(R), in Hentenryck P. van(ed.), Proceedings of the Eleventh International Conference on Logic Programming (ICLP94), MIT Press, Cambridge, MA, 1994.
Colmerauer A.: An Introduction to Prolog III, Communications of the ACM, 33(7), 69–90, 1990.
Dantzig G.B.: Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
Hentenryck P.van, Ranachandran V.: Backtracking without Trailing in CLP(R) Dept.of Computer Science, Brown University, CS-93-51, 1993.
Holzbaur C.: Specification of Constraint Based Inference Mechanisms through Extended Unification, Department of Medical Cybernetics and Artificial Intelligence, University of Vienna, Dissertation, 1990.
Holzbaur C.: Metastructures vs. Attributed Variables in the Context of Extensible Unification, in Bruynooghe M. & Wirsing M.(eds.), Programming Language Implementation and Logic Programming, Springer, LNCS 631, pp.260–268, 1992.
Holzbaur C.: Extensible Unification as Basis for the Implementation of CLP Languages, in Baader F., et al., Proceedings of the Sixth International Workshop on Unification, Boston University, MA, TR-93-004, pp.56–60, 1993.
Imbert J.-L., Cohen J., Weeger M.-D.: An Algorithm for Linear Constraint Solving: Its Incorporation in a Prolog Meta-Interpreter for CLP, in Special Issue: Constraint Logic Programming, Journal of Logic Programming, 16(3&4), 235–253, 1993.
Lassez J.L.: Parametric Queries, Linear Constraints and Variable Elimination, in Proceedings of the Conference on Design and Implementation of Symbolic Computation Systems, Capri, pp.164–173, 1990.
Menezes F., Barahona P.: Preliminary Formalization of an Incremental Hierarchical Constraint Solver. In L. Damas L and M. Filgueiras (eds.), In Proceedings of EPIA '93, Springer-Verlag, Porto, October 1993.
Menezes F., Barahona P.: An Incremental Hierarchical Constraint Solver. In V. Saraswat and P. Van Hentenryck, editors, Principles and Practice of Constraint Programming, MIT Press, 1995.
Menezes F., Barahona P.: Defeasible Constraint Solving. In Proceedings of Iberamia 94, McGraw-Hill Interamericana de Venezuela, Caracas, October 1994.
Murty K.G.: Linear and Combinatorial Programming, Wiley, New York, 1976.
Wilson M., Borning A.: Hierarchical Constraint Logic Programming. J. Logic Programming, 1993:16.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzbaur, C., Menezes, F., Barahona, P. (1996). Defeasibility in CLP(\(\mathcal{Q}\)) through generalized slack variables. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_76
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive