Titlebook: Executable Modal and Temporal Logics; IJCAI ‘93 Workshop, Michael Fisher,Richard Owens Conference proceedings 1995 Springer-Verlag Berlin

Coeval

動(dòng)機(jī)

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/318438.jpg

interior

青春期

的’

Helen Parkhurst and the Dalton School, treats permissions as specialized obligations. The results of this prototype system have been evaluated and were the subject for further study. The second half of this paper looks into computationally attractive formalisms that capture deontic modalities more naturally.

IRK

A combination of clausal and non clausal temporal logic programs,mporal Logic. The verifier features deterministic tableau expansion and binary decision tree representation of subterms. Combining these, we can avoid repeated similar clausal form time constraints, and it is possible to execute wider range of specifications without time-backtracking.

enchant

,Solving air-traffic problems with “possible worlds”, of . that provides an efficient implementation of the possible worlds and, as it showed, is well suited for nonmonotonic reasoning..As an example of the use of . in real life situations we present its solution to the aircraft sequencing problem.

THE

滑稽

0302-9743 France in August 1993..The direct execution of logical statements, through languages such as PROLOG, has proved remarkably successful within CS and AI. In recent years a variety of nonclassical logics have been introduced and several executable forms of these logics have been applied to programming.

動(dòng)機(jī)

https://doi.org/10.1007/978-3-7091-4328-5e languages are still experimental, they are beginning to be applied, not only in Computer Science and AI, but also in less obvious areas such as process control and social modelling..This paper provides an introduction to some of the basic concepts of executable modal and temporal logics.