Jicheng Zhao

Learn More
Fages showed that if a program is tight, then every propositional model of its completion is also its stable model. Recently, Babovich, Erdem, and Lif-schitz generalized Fages' result, and showed that this is also true if the program is tight on the given model of the completion. As it turned out, this is quite a general result. Among the commonly known(More)
We show that a Horn SAT and logic programming approach to obtain polynomial time algorithms for problem solving can be fruitfully applied to finding plans for various kinds of goals in a non-deterministic domain. We particularly focus on finding weak, strong, and strong cyclic plans for planning problems, as they are the most studied ones in the literature.(More)
One important aspect in directing cognitive robots or agents is to formally specify what is expected of them. This is often referred to as goal specification. Temporal logics such as LTL, and CTL * have been used to specify goals of cogni-tive robots and agents when their actions have deterministic consequences. It has been suggested that in domains where(More)
Temporal logics are widely used in specifying goals of agents. We noticed that when directing agents, humans often revise their requirements for the agent, especially as they gather more knowledge about the domain. However, all existing temporal logics, except one, do not focus on the revision of goals in an elaboration tolerant manner. Thus formal temporal(More)
The structure of the title compound, [Mg(AlH(4))(2)(C(4)H(8)O)(4)], has been redetermined at 150 K. The Mg(II) ion is hexa-coordinated to four tetra-hydro-furan (THF) ligands, and two AlH(4) (-) anions through bridging H atoms. The Al-H distances are more precise compared to those previously determined [Nöth et al. (1995 ▶). Chem. Ber. 128, 999-1006;(More)
  • 1