English
Related papers

Related papers: Mining Beyond the Bools: Learning Data Transformat…

200 papers

A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…

Logic in Computer Science · Computer Science 2020-04-28 Martin Lück

Reinforcement learning has been applied to many interesting problems such as the famous TD-gammon and the inverted helicopter flight. However, little effort has been put into developing methods to learn policies for complex persistent tasks…

Artificial Intelligence · Computer Science 2016-06-22 Xiao Li , Calin Belta

We propose a new method for mining frequent patterns in a language that combines both Semantic Web ontologies and rules. In particular we consider the setting of using a language that combines description logics with DL-safe rules. This…

Logic in Computer Science · Computer Science 2015-03-13 Joanna Jozefowska , Agnieszka Lawrynowicz , Tomasz Lukaszewski

Training statistical dialog models in spoken dialog systems (SDS) requires large amounts of annotated data. The lack of scalable methods for data mining and annotation poses a significant hurdle for state-of-the-art statistical dialog…

Computation and Language · Computer Science 2016-06-28 Lu Wang , Larry Heck , Dilek Hakkani-Tur

This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks,…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Cristian-Ioan Vasile , Derya Aksaray , Calin Belta

The synthesis of reactive systems from linear temporal logic (LTL) specifications is an important aspect in the design of reliable software and hardware. We present our adaption of the classic automata-theoretic approach to LTL synthesis,…

Logic in Computer Science · Computer Science 2020-02-21 Michael Luttenberger , Philipp J. Meyer , Salomon Sickert

Many systems are naturally modeled as Markov Decision Processes (MDPs), combining probabilities and strategic actions. Given a model of a system as an MDP and some logical specification of system behavior, the goal of synthesis is to find a…

Logic in Computer Science · Computer Science 2020-09-24 Andrew M. Wells , Morteza Lahijanian , Lydia E. Kavraki , Moshe Y. Vardi

We provide a dynamic programming algorithm for the monitoring of a fragment of Timed Propositional Temporal Logic (TPTL) specifications. This fragment of TPTL, which is more expressive than Metric Temporal Logic, is characterized by…

Logic in Computer Science · Computer Science 2016-12-12 Adel Dokhanchi , Bardh Hoxha , Cumhur Erkan Tuncali , Georgios Fainekos

Text-to-SQL, the process of translating natural language into Structured Query Language (SQL), represents a transformative application of large language models (LLMs), potentially revolutionizing how humans interact with data. This paper…

Large Language Models (LLMs) exhibit remarkable generative capabilities, enabling the generation of valuable information. Despite these advancements, previous research found that LLMs sometimes struggle with adhering to specific constraints…

Artificial Intelligence · Computer Science 2024-02-27 Kaiwen Wei , Jingyuan Zhang , Hongzhi Zhang , Fuzheng Zhang , Di Zhang , Li Jin , Yue Yu

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

Transformers are designed for discrete tokens, yet many real-world signals are continuous processes observed through noisy sampling. Discrete tokenizations (raw values, patches, finite differences) can be brittle in low signal-to-noise…

Machine Learning · Computer Science 2026-01-21 Griffin Kearney

This thesis focuses on process mining on event data where such a normative specification is absent and, as a result, the event data is less structured. The thesis puts special emphasis on one application domain that fits this description:…

Artificial Intelligence · Computer Science 2019-09-05 Niek Tax

Speech language models refer to language models with speech processing and understanding capabilities. One key desirable capability for speech language models is the ability to capture the intricate interdependency between content and…

Computation and Language · Computer Science 2025-08-11 Kaizhi Qian , Xulin Fan , Junrui Ni , Slava Shechtman , Mark Hasegawa-Johnson , Chuang Gan , Yang Zhang

This paper studies satisfaction of temporal properties on unknown stochastic processes that have continuous state spaces. We show how reinforcement learning (RL) can be applied for computing policies that are finite-memory and deterministic…

Systems and Control · Electrical Eng. & Systems 2020-09-29 Milad Kazemi , Sadegh Soudjani

Learning from demonstration (LfD) has succeeded in tasks featuring a long time horizon. However, when the problem complexity also includes human-in-the-loop perturbations, state-of-the-art approaches do not guarantee the successful…

Robotics · Computer Science 2024-12-10 Yanwei Wang , Nadia Figueroa , Shen Li , Ankit Shah , Julie Shah

Signal Temporal Logic (STL) is a formalism used to rigorously specify requirements of cyberphysical systems (CPS), i.e., systems mixing digital or discrete components in interaction with a continuous environment or analog com- ponents. STL…

Systems and Control · Computer Science 2015-06-30 Jyotirmoy V. Deshmukh , Alexandre Donzé , Shromona Ghosh , Xiaoqing Jin , Garvit Juniwal , Sanjit A. Seshia

Pre-training language models (LMs) on large-scale unlabeled text data makes the model much easier to achieve exceptional downstream performance than their counterparts directly trained on the downstream tasks. In this work, we study what…

Computation and Language · Computer Science 2022-02-21 Cheng-Han Chiang , Hung-yi Lee

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper…

Formal Languages and Automata Theory · Computer Science 2017-05-25 Mikaël Mayer , Jad Hamza , Viktor Kuncak

Children acquire their native language with apparent ease by observing how language is used in context and attempting to use it themselves. They do so without laborious annotations, negative examples, or even direct corrections. We take a…

Computation and Language · Computer Science 2021-03-18 Christopher Wang , Candace Ross , Yen-Ling Kuo , Boris Katz , Andrei Barbu