Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Nonmonotonic logic and temporal projection
Artificial Intelligence
The anomalous extension problem in default reasoning
Artificial Intelligence
Signed data dependencies in logic programs
Journal of Logic Programming
Logic programming
Frames in the space of situations (research note)
Artificial Intelligence
Combining logic and differential equations for describing real-world systems
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Nonmonotonic reasoning in the framework of situation calculus
Artificial Intelligence - Special issue on knowledge representation
A monotonicity theorem for extended logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Formalizing Commonsense: Papers by John McCarthy
Formalizing Commonsense: Papers by John McCarthy
Soundness and completeness theorems for three formalizations of action
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Representing concurrent actions in extended logic programming
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Formal theories of action (preliminary report)
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
A knowledge representation problem can be sometimes viewed as an element of a family of problems, with parameters corresponding to possible assumptions about the domain under consideration. When additional assumptions are made, the class of domains that are being described becomes smaller, so that the class of conclusions that are true in all the domains becomes larger. As a result, a satisfactory solution to a parametric knowledge representation problem on the basis of some nonmonotonic formalism can be expected to have a certain formal property, that we call restricted monotonicity. We argue that it is important to recognize parametric knowledge representation problems and to verify restricted monotonicity for their proposed solutions.