English
Related papers

Related papers: Temporal Logic Programs with Variables

200 papers

Signal Temporal Logic (STL) is widely used to specify timed and safety-critical tasks for cyber-physical systems, but writing STL formulas directly is difficult for non-expert users. Natural language (NL) provides a convenient interface,…

Computation and Language · Computer Science 2026-03-31 Kosei Fushimi , Kazunobu Serizawa , Junya Ikemoto , Kazumune Hashimoto

Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language. This richer formalism comes at the price of higher computational…

Computational Complexity · Computer Science 2020-01-14 Markus Hecher , Michael Morak , Stefan Woltran

Reinforcement Learning (RL) has shown promise in various robotics applications, yet its deployment on real systems is still limited due to safety and operational constraints. The safe RL field has gained considerable attention in recent…

Robotics · Computer Science 2026-03-19 Sadık Bera Yüksel , Ali Tevfik Buyukkocak , Derya Aksaray

Temporal logic rules are often used in control and robotics to provide structured, human-interpretable descriptions of trajectory data. These rules have numerous applications including safety validation using formal methods, constraining…

Machine Learning · Computer Science 2025-04-29 Emi Soroka , Rohan Sinha , Sanjay Lall

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…

Logic in Computer Science · Computer Science 2017-01-11 Joel Ouaknine , James Worrell

Temporal logic provided an appealing approach to specifying properties of operating systems and other "reactive" software by allowing propositions to be qualified by "when" they must be true. This paper shows how to get the same effect,…

Logic in Computer Science · Computer Science 2026-01-16 Victor Yodaiken

We present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have…

Logic in Computer Science · Computer Science 2025-10-14 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

We propose an approach to formally specifying the behavioral properties of systems that rely on a perception model for interactions with the physical world. The key idea is to introduce embeddings -- mathematical representations of a…

Artificial Intelligence · Computer Science 2025-03-07 Parv Kapoor , Abigail Hammer , Ashish Kapoor , Karen Leung , Eunsuk Kang

For over a decade, researchers in formal methods tried to create formalisms that permit natural specification of systems and allow mathematical reasoning about their correctness. The availability of fully-automated reasoning tools enables…

Software Engineering · Computer Science 2016-11-17 D. Paun , M. Chechik

Autonomous agents often operate in uncertain environments where their decisions are made based on beliefs over states of targets. We are interested in controller synthesis for complex tasks defined over belief spaces. Designing such…

Systems and Control · Computer Science 2015-10-30 Chanyeol Yoo , Calin Belta

We combine quantified differential dynamic logic (QdL) for reasoning about the possible behavior of distributed hybrid systems with temporal logic for reasoning about the temporal behavior during their operation. Our logic supports…

Logic in Computer Science · Computer Science 2012-07-12 Ping Hou

Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of…

Logic in Computer Science · Computer Science 2011-11-15 Takashi Tomita , Shigeki Hagihara , Naoki Yonezaki

The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as…

Logic in Computer Science · Computer Science 2020-11-03 Michele Chiari , Dino Mandrioli , Matteo Pradella

Signal Temporal Logic (STL) is an efficient technique for describing temporal constraints. It can play a significant role in robotic manipulation, for example, to optimize the robot performance according to task-dependent metrics. In this…

Robotics · Computer Science 2021-10-04 Akshay Dhonthi , Philipp Schillinger , Leonel Rozo , Daniele Nardi

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time,…

Logic in Computer Science · Computer Science 2011-01-11 Julien Cristau

We reformulate the signal temporal logic (STL) synthesis problem as a maximum a-posteriori (MAP) inference problem. To this end, we introduce the notion of random STL~(RSTL), which extends deterministic STL with random predicates. This new…

Robotics · Computer Science 2021-05-14 Ki Myung Brian Lee , Chanyeol Yoo , Robert Fitch

Alternating-time temporal logics (ATL/ATL*) represent a family of modal logics for reasoning about agents' strategic abilities in multiagent systems (MAS). The interpretations of ATL/ATL* over the semantic model Concurrent Game Structures…

Artificial Intelligence · Computer Science 2018-11-28 Yedi Zhang , Fu Song , Taolue Chen

We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by…

Logic in Computer Science · Computer Science 2009-04-08 Stéphane Demri , David Nowak

Signal Temporal Logic (STL) has emerged as an expressive language for reasoning intricate planning objectives. However, existing STL-based methods often assume full observation and known dynamics, which imposes constraints on real-world…

Robotics · Computer Science 2025-08-27 Peiran Liu , Yiting He , Yihao Qin , Hang Zhou , Yiding Ji

A logic programming paradigm which expresses solutions to problems as stable models has recently been promoted as a declarative approach to solving various combinatorial and search problems, including planning problems. In this paradigm,…

Artificial Intelligence · Computer Science 2007-05-23 Maurice Bruynooghe
‹ Prev 1 8 9 10 Next ›