Results 301 to 310 of about 2,393,674 (352)
Some of the next articles are maybe not open access.
A Decidable Intuitionistic Temporal Logic
Annual Conference for Computer Science Logic, 2017We introduce the logic $\sf ITL^e$, an intuitionistic temporal logic based on structures $(W,\preccurlyeq,S)$, where $\preccurlyeq$ is used to interpret intuitionistic implication and $S$ is a $\preccurlyeq$-monotone function used to interpret temporal ...
Joseph Boudou +2 more
semanticscholar +1 more source
Temporal Logic Programs with Temporal Description Logic Axioms
2019In this paper we introduce a combination of Answer Set Programming (ASP) and Description Logics (DL) (in particular, \(\mathcal{ALC}\)) on top of a modal temporal basis using connectives from Linear-time Temporal Logic (LTL). On the one hand, for the temporal extension of \(\mathcal{ALC}\), we depart from Baader et al.’s proposal \(\mathcal{ALC}\)-LTL ...
Pedro Cabalar, Torsten Schaub
openaire +1 more source
Journal of Automated Reasoning, 1989
Let T denote closure of the set of formulas of the form P \((term_ 1,...,term_ n)\) under operation of conjunction and temporal operators of some kind (f. E. operators ``always'', ``until'' and so on), and TR be the set of formulas (rules) of the form \(f_ 1 \&...\& f_ m\to f_{m+1}\), where \(f_ i\) belongs to T.
openaire +1 more source
Let T denote closure of the set of formulas of the form P \((term_ 1,...,term_ n)\) under operation of conjunction and temporal operators of some kind (f. E. operators ``always'', ``until'' and so on), and TR be the set of formulas (rules) of the form \(f_ 1 \&...\& f_ m\to f_{m+1}\), where \(f_ i\) belongs to T.
openaire +1 more source
The Temporal Logic of Reactive and Concurrent Systems
Springer: New York, 1991Z. Manna, A. Pnueli
semanticscholar +1 more source
Dynamic Epistemic Temporal Logic
2009We introduce a new type of arrow in the update frames (or "action models") of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in multi-agent systems that need not be synchronous. Since van Benthem and Pacuit (later joined by Hoshi and Gerbrandy) showed that standard Dynamic Epistemic Logic necessarily ...
Renne, B., Sack, Joshua, Yap, Audrey
openaire +2 more sources
A Temporal Logic of Nested Calls and Returns
International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2004R. Alur, K. Etessami, P. Madhusudan
semanticscholar +1 more source