Temporal logic programming

Journal of Symbolic Computation - Tập 8 Số 3 - Trang 277-295 - 1989
Martı́n Abadi1, Zohar Manna1
1Computer Science Department, Stanford University, Stanford, CA 94305 USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

Abadi, 1987, Temporal-Logic Theorem Proving

Abadi, 1985, Nonclausal temporal deduction, 193, 1

Abadi, 1986, A timely resolution, 176

Abadi, 1987, Temporal logic programming, 4

Arthaud, 1986

Ashcroft, 1985

Baudinet, 1989, Temporal logic programming is complete and expressive

Clifford, 1985, On an algebra for historical relational databases: two views, 247

Clocksin, 1981

DeGroot, 1986

Fagin, 1984, Issues in caching PROLOG goals

Fujita, 1986, TOKIO: logic programming language based on temporal logic and its compilation to PROLOG

Gabbay, 1987

Gadia, 1986, Weak temporal relations, 70

Hattori, 1986, RACCO: a modal-logic programming language for writing models of real-time process-control systems, 10.1016/B978-0-12-037103-7.50010-3

Kowalski, 1985

Lamport, 1983, Specifying concurrent program modules, ACM Transactions on Programming Languages and Systems, 5, 190, 10.1145/69624.357207

Lloyd, 1983

Moszkowski, 1984, Executing Temporal Logic Programs

McCarthy, 1984

Malachi, 1986, 365

Pnueli, 1981, The temporal semantics of concurrent programs, Theoretical Computer Science, 13, 45, 10.1016/0304-3975(81)90110-9

Snodgrass, 1985, A taxonomy of time in databases, 236

Sakuragawa, 1989, Temporal prolog

Wadge, 1985

Wagner-Dietrich, 1986, Extension tables: memo relations in logic programming