innate
发表于 2025-3-30 11:12:26
A logic for reasoning about safety in decision support systems,at actions recommended by the system will have minimal undesirable consequences. The objective of this paper is to proposes a logical formalism for reasoning about the . of a decision support system. The proposed logical language makes provision for representing time, preferences, actions and also d
围巾
发表于 2025-3-30 14:56:29
http://reply.papertrans.cn/89/8839/883842/883842_52.png
pulmonary
发表于 2025-3-30 16:54:00
Uncertainty in constraint satisfaction problems: A probabilistic approach,y that it is a part of the real problem (the latter being only partially known). The probability degrees on the relevance of the constraints enable us to define, for each instanciation, the probability that it is a solution of the real problem. We briefly give a methodology for the search of the bes
古文字学
发表于 2025-3-30 21:40:44
A unifying logical framework for reason maintenance,cation based as well as for assumption based methods, thus giving a . semantics to both of them. Instead of restricting ourselves to only propositional Horn clauses, we‘ll admit arbitrary logics, e.g. full first order language. This enables us to characterize systems as a whole, including both the r
裤子
发表于 2025-3-31 04:35:10
http://reply.papertrans.cn/89/8839/883842/883842_55.png
厚颜无耻
发表于 2025-3-31 06:07:51
http://reply.papertrans.cn/89/8839/883842/883842_56.png
CODA
发表于 2025-3-31 11:44:54
http://reply.papertrans.cn/89/8839/883842/883842_57.png
隼鹰
发表于 2025-3-31 14:36:07
: A formalism for reasoning with relative-strength defaults,ncerning it is devised. The resulting system, also called ., is then compared to ... We show that, while . is very similar to .. and displays comparable reasoning processes most of the time, they are not the same and . is more in agreement with common sense in some situations. Comparing . to the str
jealousy
发表于 2025-3-31 20:16:37
http://reply.papertrans.cn/89/8839/883842/883842_59.png
Astigmatism
发表于 2025-4-1 00:16:15
Restricted access logics for inconsistent information,ms — formulae are labelled, and proof rules defined to manipulate both the formulae and the labels. The extra conditions on the proof rules are then defined in terms of the labels. This gives us a class of logics, called restricted access logics, that meet the desiderata above.