## Temporal Logic: First International Conference, ICTL '94, Bonn, Germany, July 11 - 14, 1994. ProceedingsThis volume constitutes the proceedings of the First International Conference on Temporal Logic (ICTL '94), held at Bonn, Germany in July 1994. Since its conception as a discipline thirty years ago, temporal logic is studied by many researchers of numerous backgrounds; presently it is in a stage of accelerated dynamic growth. This book, as the proceedings of the first international conference particularly dedicated to temporal logic, gives a thorough state-of-the-art report on all aspects of temporal logic research relevant for computer science and AI. It contains 27 technical contributions carefully selected for presentation at ICTL '94 as well as three surveys and position papers. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Combining Temporal Specification Techniques | 1 |

Global Equivalence Proofs for ISTL | 17 |

A Real Time Process Logic | 30 |

SOMETIMES TOMORROW IS SOMETIME Action Refinement in a Temporal Logic of Objects | 48 |

Applications of Transaction Logic to Knowledge Representation | 67 |

Circumscribing Features and Fluents | 82 |

Dealing with Time Granularity in a Temporal Planning System | 101 |

M Reynolds1 | 117 |

On the Completeness of Temporal Database Query Languages | 283 |

The Abductive Event Calculus as a General Framework for Temporal Databases | 301 |

A Decision Procedure for a Temporal Belief Logic | 317 |

Decidability of Deliberative Stit Theories with Multiple Agents | 332 |

Abduction in Temporal Reasoning | 349 |

A Temporal Logic Approach to Implementation and Refinement in Timed Petri Nets | 365 |

Modular Reasoning about Concurrent Programs | 382 |

A Hierarchy of Partial Order Temporal Properties | 398 |

Temporal Logic with Reference Pointers | 133 |

Completeness through Flatness in TwoDimensional Temporal Logic | 149 |

Efficient Computation of Nested FixPoints with Applications to Model Checking | 165 |

How Linear Can Branchingtime Be? | 180 |

FirstOrder Future Interval Logic | 195 |

Buy One Get One Free | 210 |

Extended Abstract | 225 |

A Compositional Unified Approach | 238 |

SYNCHRONIZED HISTORIES IN PRIORTHOMASON REPRESENTATION OF BRANCHING TIME | 265 |

A GraphBased Approach To Resolution In Temporal Logic | 415 |

AnnotationBased Deduction in Temporal Logic | 430 |

An Overview of Temporal and Modal Logic Programming | 445 |

A Survey of Concurrent METATEM The Language and its Applications | 480 |

Temporal Query Languages a Survey | 506 |

Improving Temporal Logic Tableaux using Integer Constraints | 535 |

546 | |

### Common terms and phrases

abductive action adverbials algebra algorithm applied Artificial Intelligence atomic axiomatization axioms Calculus Chronolog clause complete Computer Science Concurrent METATEM consider consistency constraints corresponding CTL2 deductive defined definition deindexing denote dstit episode equivalent event Event Calculus example execution extended finite first-order first-order logic formal frame function given goal granularity implementation induction infinite instance interpretation interval Lemma linear linear temporal logic logic programming modal logic modal logic programming modal operators model checking natural numbers node notion object Petri nets Pnueli predicate problem procedure Prolog proof properties propositions quantifiers query languages ready trace refinement relation relational algebra represented result rules satisfied scenario Scott topology semantics sequence specification structure subset symbols Templog temporal databases temporal domain temporal formula temporal logic temporal operators Temporal Prolog temporal query theorem theory timestamp transaction transition true tuple valid variables

### Popular passages

Page 539 - August 1986. [3] J. Burch, E. Clarke, K. McMillan, and D. Dill. Sequential Circuit Verification Using Symbolic Model Checking.