摘要
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.
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.
