[PDF][PDF] String shuffling over a gap between parsing and plan recognition
J Maraist - Workshops at the Thirty-First AAAI Conference on …, 2017 - cdn.aaai.org
We propose a new probabilistic plan recognition algorithm YR based on an extension of
Tomita's Generalized LR (GLR) parser for grammars enriched with the shuffle operator. YR …
Tomita's Generalized LR (GLR) parser for grammars enriched with the shuffle operator. YR …
Regularity conditions for iterated shuffle on commutative regular languages
S Hoffmann - International Journal of Foundations of Computer …, 2023 - World Scientific
We introduce the class 𝒞𝒪𝓂 S+ of commutative regular languages that is a positive variety
closed under binary shuffle and iterated shuffle (also called shuffle closure). This class …
closed under binary shuffle and iterated shuffle (also called shuffle closure). This class …
[PDF][PDF] On Special Description Logics for Processes and Plans.
Representing and reasoning with processes and plans is a core problems in many areas,
including AI Planning and Plan Recognition, Business Process Modeling, Web Services …
including AI Planning and Plan Recognition, Business Process Modeling, Web Services …
An effective algorithm for learning single occurrence regular expressions with interleaving
The advantages offered by the presence of a schema are numerous. However, many XML
documents in practice are not accompanied by a (valid) schema, making schema inference …
documents in practice are not accompanied by a (valid) schema, making schema inference …
Initial steps towards a family of regular-like plan description logics
A Borgida - Description Logic, Theory Combination, and All That …, 2019 - Springer
A wide range of ordinary Description Logics (DLs) have been explored by considering
collections of concept/role constructors, and types of terminologies, yielding an array of …
collections of concept/role constructors, and types of terminologies, yielding an array of …
Membership Algorithm for Single-Occurrence Regular Expressions with Shuffle and Counting
X Wang - International Conference on Database Systems for …, 2022 - Springer
Since shuffle introduced into regular expressions makes the membership problem NP-hard,
and an efficient membership algorithm facilitates processing many membership-based …
and an efficient membership algorithm facilitates processing many membership-based …
Learning finite automata with shuffle
X Wang - Pacific-Asia Conference on Knowledge Discovery and …, 2021 - Springer
Learning finite automata has been a popular topic. Shuffle has been applied in information
systems. Since shuffle introduced into finite automata makes the membership problem NP …
systems. Since shuffle introduced into finite automata makes the membership problem NP …
The n-ary Initial Literal and Literal Shuffle
S Hoffmann - arXiv preprint arXiv:2108.09282, 2021 - arxiv.org
The literal and the initial literal shuffle have been introduced to model the behavior of two
synchronized processes. However, it is not possible to describe the synchronization of …
synchronized processes. However, it is not possible to describe the synchronization of …
The membership problem for linear and regular permutation languages
G Madejski - Implementation and Application of Automata: 20th …, 2015 - Springer
We analyze the complexity of membership problem for two subclasses of permutation
languages: PermReg and PermLin. These are languages generated by regular and linear …
languages: PermReg and PermLin. These are languages generated by regular and linear …
Inferring Restricted Regular Expressions with Interleaving from Positive and Negative Samples
The presence of a schema for XML documents has numerous advantages. Unfortunately,
many XML documents in practice are not accompanied by a schema or a valid schema …
many XML documents in practice are not accompanied by a schema or a valid schema …