Results 331 to 340 of about 430,787 (365)
Some of the next articles are maybe not open access.
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
Journal of Logic and Computation, 2005The paper concerns the problem of logical consequence in linear temporal logics in terms of logical consecutions. A logical consecution c is an expression ψ1,...,ψn/ψ, where all ψi and ψ are formulas. An informal meaning of c is 'ψ is a logical consequence of assumptions ψ1,...ψn'.
openaire +2 more sources
Linear Temporal Logic of Constraint Automata
2008Constraint automata are formalisms to describe the behavior and possible data flow in coordination models. In this paper we introduce a linear time temporal logic, called temporal logic of steps (TLS), for specifying the executions of constraint automata. TLS is the first attempt in presenting a linear temporal logic for constraint automata. Having TLS
Sara Navidpour, Mohammad Izadi
openaire +1 more source
IEEE transactions on industrial electronics (1982. Print)
Temporal logic-based motion planning has been extensively studied to address complex robotic tasks. However, existing works primarily focus on static environments or assume the robot has full observations of the environment.
Zhangli Zhou +5 more
semanticscholar +1 more source
Temporal logic-based motion planning has been extensively studied to address complex robotic tasks. However, existing works primarily focus on static environments or assume the robot has full observations of the environment.
Zhangli Zhou +5 more
semanticscholar +1 more source
Regular Linear Temporal Logic with Past
2010This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logic (LTL) to all ω-regular languages. The syntax of RLTL consists of an algebraic signature from which expressions are built.
César Sánchez, Martin Leucker
openaire +1 more source
Linear temporal logic and Linear Dynamic Logic on finite traces
2013In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf.
DE GIACOMO, Giuseppe, Moshe Y. Vardi
openaire +1 more source
Logic-in-memory based on an atomically thin semiconductor
Nature, 2020Guilherme Migliato Marega +2 more
exaly
Gallium nitride-based complementary logic integrated circuits
Nature Electronics, 2021Zheyang Zheng, Li Zhang, Han Xu
exaly
Logic gates based on neuristors made from two-dimensional materials
Nature Electronics, 2021Chunsen liu, Jianlu Wang, Weida Hu
exaly

