DocumentCode
1805598
Title
First order modal temporal logics with generalized intervals
Author
Becher, Gérard
Author_Institution
Caen Univ., France
fYear
1996
fDate
19-20 May 1996
Firstpage
170
Lastpage
175
Abstract
Following the work of G. Ligozat (1991) who described the interval algebras A(S) whose elements are relations on generalized intervals, the author proposes a class of first order modal temporal logics where the possible worlds are points, standard intervals or unions of convex intervals and where the accessibility relations are elements of A(S). These logics have standard syntax and semantics with the unique exception that, whereas predicates are generally interpreted on intervals, the terms are always interpreted on points which are considered as elements of the intervals. He also addresses the problem of automated reasoning in such logics and defines for that sake a satisfiability and validity preserving translation function into a standard two-sorted first order logic
Keywords
computability; relational algebra; temporal logic; temporal reasoning; accessibility relations; automated reasoning; convex intervals; first order modal temporal logics; generalized intervals; interval algebras; points; predicates; satisfiability preserving translation function; semantics; syntax; two-sorted first order logic; validity preserving translation function; Boolean algebra; Knowledge representation; Logic functions;
fLanguage
English
Publisher
ieee
Conference_Titel
Temporal Representation and Reasoning, 1996. (TIME '96), Proceedings., Third International Workshop on
Conference_Location
Key West, FL
Print_ISBN
0-8186-7528-4
Type
conf
DOI
10.1109/TIME.1996.555696
Filename
555696
Link To Document