Abstract
We describe some ideas and results about the following problem: Given a set, a family of “preference relations” on the set, and a “priority” among those preference relations, which elements of the set are best? That is, which elements are most preferred by a consensus of the preference relations which takes account of their relative priority? The problem is posed in a deliberately general way, to capture a wide variety of examples.
Our main result gives sufficient conditions for the existence of ‘best’ elements for an important instance of the problem: preference relations are pre-orders, the priority among them is a partial order, and the definition of best elements uses a generalisation of lexicographic ordering.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press, 1990.
J. Fiadeiro and T. Maibaum. Temporal reasoning over deontic specifications. Journal of Logic and Computation, 1 (3): 357–395, 1991.
B. N. Grosof. Generalising prioritization. In J. Allen, R. Fikes, and E. Sandewall, editors, Proc. Second International Conference on Principles of Knowledge Representation and Reasoning (KR’91), pages 289–300. Morgan Kaufmann, 1991.
V. Lifschitz. Pointwise circumscription. In M. L. Ginsberg, editor, Readings in Non-monotonic Logic. Morgan Kaufmann, 1987.
D. Makinson. General theory of cumulative inference. In M. Reinfrank, J. de Kleer, and M. L. Ginsberg, editors, Non-monotonic Reasoning. Lecture Notes in Artificial Intelligence 346, Springer-Verlag, 1988.
J. McCarthy. Circumscription—a form of non-monotonic reasoning. Artificial Intelligence, 13: 27–39, 1980.
M. D. Ryan. Defaults and revision in structured theories. In Proc. Sixth IEEE Symposium on Logic in Computer Science (LICS), pages 362–373, 1991.
M. D. Ryan. Ordered Presentations of Theories: Default Reasoning and Belief Revision. PhD thesis, Department of Computing, Imperial College, 1992.
M. D. Ryan. Representing defaults as sentences with reduced priority. In B. Nebel and W. Swartout, editors Proc. Third International Conference on Principles of Knowledge Representation and Reasoning (KR’92). Morgan Kaufmann, 1992.
M. D. Ryan. Towards specifying norms.Annals of Mathematics and Artificial Intelligence 1993. In print.
M. D. Ryan and P.-Y. Schobbens. Laws of generalised prioritisation. In preparation.
P.-Y. Schobbens. Exceptions in Algebraic Specifications. PhD thesis, Unité d’Informatique, Université Catholique de Louvain, Belgium, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Ryan, M. (1993). Prioritising Preference Relations. In: Burn, G., Gay, S., Ryan, M. (eds) Theory and Formal Methods 1993. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3503-6_21
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3503-6_21
Publisher Name: Springer, London
Print ISBN: 978-3-540-19842-0
Online ISBN: 978-1-4471-3503-6
eBook Packages: Springer Book Archive