4-[bis-(2-chloro-ethyl)-amino]-cyclohexanecarboxylic acid ethyl ester | 131866-78-9

• 英文名称: 4-[bis-(2-chloro-ethyl)-amino]-cyclohexanecarboxylic acid ethyl ester
• 英文别名: 4-[Bis-(2-chlor-aethyl)-amino]-cyclohexancarbonsaeure-aethylester；ethyl 4-[bis(2-chloroethyl)amino]cyclohexane-1-carboxylate
• CAS: 131866-78-9
• 化学式: C₁₃H₂₃Cl₂NO₂
• 分子量: 296.237
• InChiKey: CTUHOAVVPUTEFE-UHFFFAOYSA-N

计算性质

• 辛醇/水分配系数(LogP)：
  2.89
• 重原子数：
  18.0
• 可旋转键数：
  7.0
• 环数：
  1.0
• sp3杂化的碳原子比例：
  0.92
• 拓扑面积：
  29.54
• 氢给体数：
  0.0
• 氢受体数：
  3.0

反应信息

• 作为反应物：
  描述：

  4-[bis-(2-chloro-ethyl)-amino]-cyclohexanecarboxylic acid ethyl ester 生成 4-[bis-(2-chloro-ethyl)-amino]-cyclohexanecarboxylic acid
  参考文献：
  名称：

  Temporal disjunctive logic programming

  摘要：

  In this paper we introduce the logic programming language Disjunctive Chronology which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of ex pressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.

  DOI：

  10.1007/bf03037535
• 作为产物：
  描述：

  4-[bis-(2-hydroxy-ethyl)-amino]-cyclohexanecarboxylic acid ethyl ester 在 氯化亚砜 作用下， 生成 4-[bis-(2-chloro-ethyl)-amino]-cyclohexanecarboxylic acid ethyl ester
  参考文献：
  名称：

  Temporal disjunctive logic programming

  摘要：

  In this paper we introduce the logic programming language Disjunctive Chronology which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of ex pressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.

  DOI：

  10.1007/bf03037535