Minimal model semantics for sorted constraint representation. (English) Zbl 0845.68072
Summary: Sorted constraint representation is a very useful representation in AI which combines class hierarchies and constraint networks. For such sorted constraint representation, a problem is how to generalize the idea of default inheritance to constraint network, where the attributes in a class or between different classes interact with each other via the network. To give a formal account for the defeasible reasoning in such representation, a general sorted constraint logic is proposed, and a minimal-model semantics for the logic is presented.
MSC:
| 68Q55 | Semantics in the theory of computing |
References:
| [1] | Ait-Kaci H, Podelski P. Towards a meaning of LIFE.J. Logic Programming, 1993, 16: 195–234. · Zbl 0782.68022 · doi:10.1016/0743-1066(93)90043-G |
| [2] | Borning A. ThingLab–An object oriented system for building simulations using constraints. InProceedings IJCAI-77, Cambridge, MA, 1977, pp. 497–499. |
| [3] | Borning A, Duisberg R, Freeman-Benson B, Kramer A, Woolf M. Constraint hierarchies. InACM OOPSLA’87 Conference Proceedings, pp.48–60. |
| [4] | Brewkwa G. Preferred subtheories: An extended logical framework for default reasoning. InIJCAI-89, Detroit, 1989, pp. 1043–1048. |
| [5] | Davis D. Constraint propagation with interval labels.Artificial Intelligence, 1987, 32: 281–331. · Zbl 0642.68176 · doi:10.1016/0004-3702(87)90091-9 |
| [6] | Davis R. Diagnosis via causal reasoning: Paths of interaction and the locality principles. InProc. AAAI-83, Washington D.C., 1983, pp.88–92. |
| [7] | Freeman-Benson B, Borning A. Integrating constraints with an object-oriented language. InProc. of the 1992 European Conference on Object-Oriented Programming, June 1992, pp.268–286. |
| [8] | Horty J F, Thomason R H, Touretzky D S. A skeptical of inheritance in nonmonotonic semantic networks.Artificial Intelligence, 1990, 42: 311–348. · Zbl 0717.68085 · doi:10.1016/0004-3702(90)90057-7 |
| [9] | Wilson M, Borning A. Hierarchical constraint logic programming.J. Logic Programming, 1993, 16: 277–318. · Zbl 0771.68038 · doi:10.1016/0743-1066(93)90046-J |
| [10] | Junker U. Prioritized defaults: Implementation by TMS and application to diagnosis. InProc. IJCAI-91, Sydney, 1991, pp.310–315. · Zbl 0747.68070 |
| [11] | Liao Lejian, Shi Zhongzhi. Prioritized default constraint reasoning. InProc. of the 3rd Int’l Conf. for Young Computer Scientists, 1993, pp.2.45–47. |
| [12] | Pollock J L. Defeasible reasoning.Cogn. Sci., 1987, 11: 481–518. · doi:10.1207/s15516709cog1104_4 |
| [13] | Poole D. On the comparison of theories: Preferring the most specific explanations. InProc. IJCAI-85, Los Angeles, CA, 1985, 144–147. |
| [14] | Poole D. A logical framework for default reasoning.Artificial Intelligence, 1988, 36: 27–47. · Zbl 0647.68094 · doi:10.1016/0004-3702(88)90077-X |
| [15] | Reiter R. A logic for default reasoning.Artificial Intelligence, 1980, 13: 81–132. · Zbl 0435.68069 · doi:10.1016/0004-3702(80)90014-4 |
| [16] | Shoham Y. A semantical approach to non-monotonic logics. InProc. IEEE Symp. Logic in Computer Science, Ithaca, New York, 1986. |
| [17] | Simari G R, Loui R P. A mathematical treatment of defeasible reasoning and its implementation.Artificial Intelligence, 1992, 53: 125–127. · Zbl 1193.68238 · doi:10.1016/0004-3702(92)90069-A |
| [18] | Touretzky D S, Horty J F, Thomason R H. A clash of intuitions: The current state of nonmonotonic multiple inheritance systems. InProc. IJCAI-87, Milan, Italy, Aug. 1987, pp. 476–482. |
| [19] | Touretzky D S, Thomason R H, Horty J F. A skeptic menagerie: Conflictors, preemptors, reinstaters, and zombies in nonmonotonic inheritance. InIJCAI-91, pp. 478–483. · Zbl 0742.68060 |
| [20] | Waltz D. Understanding line drawing of scenes with shadows. In P. Winston (ed.)The Psychology of Computer Vision, McGraw-Hill, New York, 1975. |
| [21] | Winston P H. Artificial Intelligence. Reading, Mass: Addison-Wesley, 1977. · Zbl 0358.68134 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
