Temporal and Modal Logic Programming :

نویسنده

  • Mehmet A. Orgun
چکیده

This paper presents a structured, annotated bibliography of extensions of logic programming based on temporal and modal logics. Temporal and modal logic programming is a new area of research, which gained momentum in the late 1980'ies. The paper discusses temporal and modal logic programming under three headings: (1) interval logic programming , (2) temporal logic programming, and (3) modal logic programming. It contains up-to-date information on the current status of the area, and it is intended for researchers and students alike as a source guide for further study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Overview of Temporal and Modal

This paper presents an overview of the development of the eld of temporal and modal logic programming. We review temporal and modal logic programming languages under three headings: (1) languages based on interval logic, (2) languages based on temporal logic, and (3) languages based on (multi)modal logics. The overview includes most of the major results developed, and points out some of the sim...

متن کامل

An infinitary encoding of temporal equilibrium logic

This paper studies the relation between two recent extensions of propositional Equilibrium Logic, a well-known logical characterisation of Answer Set Programming. In particular, we show how Temporal Equilibrium Logic, which introduces modal operators as those typically handled in Linear-Time Temporal Logic (LTL), can be encoded into Infinitary Equilibrium Logic, a recent formalisation that allo...

متن کامل

Paving the Way for Temporal Grounding

In this paper we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. We provide several fundamental contributions that pave the way for the implementation of a grounding process, that is, a method that allows replacing variables...

متن کامل

Deriving Inverse Operators for Modal Logic

Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. We shall use spatial constraint systems to give an abstract characterization of the notion of normality in modal logic and to derive right inverse/reverse operators for modal languages. In particular, we shall identify the weakest condition...

متن کامل

Tactic-based theorem proving in First-Order Modal and Temporal Logics

We describe the ongoing work on a tactic-based theorem prover for First-Order Modal and Temporal Logics (FOTLs for the temporal ones). In formal methods, especially temporal logics play a determining role; in particular, FOTLs are natural whenever the modeled systems are infinite-state. But reasoning in FOTLs is hard and few approaches have so far proved effective. Here we introduce a family of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994