id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2306.12552
|
Yunxiang Zhang
|
Yunxiang Zhang, Xiaojun Wan
|
SituatedGen: Incorporating Geographical and Temporal Contexts into
Generative Commonsense Reasoning
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, commonsense reasoning in text generation has attracted much
attention. Generative commonsense reasoning is the task that requires machines,
given a group of keywords, to compose a single coherent sentence with
commonsense plausibility. While existing datasets targeting generative
commonsense reasoning focus on everyday scenarios, it is unclear how well
machines reason under specific geographical and temporal contexts. We formalize
this challenging task as SituatedGen, where machines with commonsense should
generate a pair of contrastive sentences given a group of keywords including
geographical or temporal entities. We introduce a corresponding English dataset
consisting of 8,268 contrastive sentence pairs, which are built upon several
existing commonsense reasoning benchmarks with minimal manual labor.
Experiments show that state-of-the-art generative language models struggle to
generate sentences with commonsense plausibility and still lag far behind human
performance. Our dataset is publicly available at
https://github.com/yunx-z/situated_gen.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2023 20:36:55 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Zhang",
"Yunxiang",
""
],
[
"Wan",
"Xiaojun",
""
]
] |
new_dataset
| 0.989812 |
2306.12567
|
Koji Mineshima
|
Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima,
Mitsuhiro Okada
|
Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning
Ability and Human-like Biases
|
To appear in Proceedings of the 4th Natural Logic Meets Machine
Learning Workshop (NALOMA IV)
| null | null | null |
cs.CL cs.AI
|
http://creativecommons.org/licenses/by/4.0/
|
This paper investigates whether current large language models exhibit biases
in logical reasoning, similar to humans. Specifically, we focus on syllogistic
reasoning, a well-studied form of inference in the cognitive science of human
deduction. To facilitate our analysis, we introduce a dataset called NeuBAROCO,
originally designed for psychological experiments that assess human logical
abilities in syllogistic reasoning. The dataset consists of syllogistic
inferences in both English and Japanese. We examine three types of biases
observed in human syllogistic reasoning: belief biases, conversion errors, and
atmosphere effects. Our findings demonstrate that current large language models
struggle more with problems involving these three types of biases.
|
[
{
"version": "v1",
"created": "Wed, 21 Jun 2023 21:04:11 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Ando",
"Risako",
""
],
[
"Morishita",
"Takanobu",
""
],
[
"Abe",
"Hirohiko",
""
],
[
"Mineshima",
"Koji",
""
],
[
"Okada",
"Mitsuhiro",
""
]
] |
new_dataset
| 0.998702 |
2306.12611
|
David Eppstein
|
David Eppstein and Rose McCarty
|
Geometric Graphs with Unbounded Flip-Width
|
10 pages, 7 figures. To appear at CCCG 2023
| null | null | null |
cs.CG math.CO
|
http://creativecommons.org/licenses/by/4.0/
|
We consider the flip-width of geometric graphs, a notion of graph width
recently introduced by Toru\'nczyk. We prove that many different types of
geometric graphs have unbounded flip-width. These include interval graphs,
permutation graphs, circle graphs, intersection graphs of axis-aligned line
segments or axis-aligned unit squares, unit distance graphs, unit disk graphs,
visibility graphs of simple polygons, $\beta$-skeletons, 4-polytopes, rectangle
of influence graphs, and 3d Delaunay triangulations.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 00:16:13 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"McCarty",
"Rose",
""
]
] |
new_dataset
| 0.993021 |
2306.12612
|
Nicholas Barbara
|
Nicholas H. Barbara, Max Revay, Ruigang Wang, Jing Cheng, Ian R.
Manchester
|
RobustNeuralNetworks.jl: a Package for Machine Learning and Data-Driven
Control with Certified Robustness
| null | null | null | null |
cs.LG cs.SY eess.SY
|
http://creativecommons.org/licenses/by/4.0/
|
Neural networks are typically sensitive to small input perturbations, leading
to unexpected or brittle behaviour. We present RobustNeuralNetworks.jl: a Julia
package for neural network models that are constructed to naturally satisfy a
set of user-defined robustness constraints. The package is based on the
recently proposed Recurrent Equilibrium Network (REN) and Lipschitz-Bounded
Deep Network (LBDN) model classes, and is designed to interface directly with
Julia's most widely-used machine learning package, Flux.jl. We discuss the
theory behind our model parameterization, give an overview of the package, and
provide a tutorial demonstrating its use in image classification, reinforcement
learning, and nonlinear state-observer design.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 00:23:37 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Barbara",
"Nicholas H.",
""
],
[
"Revay",
"Max",
""
],
[
"Wang",
"Ruigang",
""
],
[
"Cheng",
"Jing",
""
],
[
"Manchester",
"Ian R.",
""
]
] |
new_dataset
| 0.999368 |
2306.12649
|
Tomohiro Motoda
|
Shusei Nagato, Tomohiro Motoda, Takao Nishi, Petit Damien, Takuya
Kiyokawa, Weiwei Wan, Kensuke Harada
|
Probabilistic Slide-support Manipulation Planning in Clutter
|
IEEE/RSJ International Conference on Intelligent Robots and Systems
(IROS 2023) (Accepted)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To safely and efficiently extract an object from the clutter, this paper
presents a bimanual manipulation planner in which one hand of the robot is used
to slide the target object out of the clutter while the other hand is used to
support the surrounding objects to prevent the clutter from collapsing. Our
method uses a neural network to predict the physical phenomena of the clutter
when the target object is moved. We generate the most efficient action based on
the Monte Carlo tree search.The grasping and sliding actions are planned to
minimize the number of motion sequences to pick the target object. In addition,
the object to be supported is determined to minimize the position change of
surrounding objects. Experiments with a real bimanual robot confirmed that the
robot could retrieve the target object, reducing the total number of motion
sequences and improving safety.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 03:33:42 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Nagato",
"Shusei",
""
],
[
"Motoda",
"Tomohiro",
""
],
[
"Nishi",
"Takao",
""
],
[
"Damien",
"Petit",
""
],
[
"Kiyokawa",
"Takuya",
""
],
[
"Wan",
"Weiwei",
""
],
[
"Harada",
"Kensuke",
""
]
] |
new_dataset
| 0.952468 |
2306.12679
|
Zeinab Rajabi Dr
|
Mojtaba Mazoochi (ICT Research Institute, Tehran, Iran), Leyla Rabiei
(Iran Telecommunication Research Center (ITRC), Tehran, Iran), Farzaneh
Rahmani (Iran Telecommunication Research Center (ITRC), Tehran, Iran), Zeinab
Rajabi (Iran Telecommunication Research Center (ITRC), Tehran, Iran)
|
Constructing Colloquial Dataset for Persian Sentiment Analysis of Social
Microblogs
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-nd/4.0/
|
Introduction: Microblogging websites have massed rich data sources for
sentiment analysis and opinion mining. In this regard, sentiment classification
has frequently proven inefficient because microblog posts typically lack
syntactically consistent terms and representatives since users on these social
networks do not like to write lengthy statements. Also, there are some
limitations to low-resource languages. The Persian language has exceptional
characteristics and demands unique annotated data and models for the sentiment
analysis task, which are distinctive from text features within the English
dialect. Method: This paper first constructs a user opinion dataset called
ITRC-Opinion by collaborative environment and insource way. Our dataset
contains 60,000 informal and colloquial Persian texts from social microblogs
such as Twitter and Instagram. Second, this study proposes a new deep
convolutional neural network (CNN) model for more effective sentiment analysis
of colloquial text in social microblog posts. The constructed datasets are used
to evaluate the presented model. Furthermore, some models, such as LSTM,
CNN-RNN, BiLSTM, and BiGRU with different word embeddings, including Fasttext,
Glove, and Word2vec, investigated our dataset and evaluated the results.
Results: The results demonstrate the benefit of our dataset and the proposed
model (72% accuracy), displaying meaningful improvement in sentiment
classification performance.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 05:51:22 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Mazoochi",
"Mojtaba",
"",
"ICT Research Institute, Tehran, Iran"
],
[
"Rabiei",
"Leyla",
"",
"Iran Telecommunication Research Center"
],
[
"Rahmani",
"Farzaneh",
"",
"Iran Telecommunication Research Center"
],
[
"Rajabi",
"Zeinab",
"",
"Iran Telecommunication Research Center"
]
] |
new_dataset
| 0.995356 |
2306.12705
|
Guanqun Cao
|
Guanqun Cao, Jiaqi Jiang, Danushka Bollegala, Min Li and Shan Luo
|
Multimodal Zero-Shot Learning for Tactile Texture Recognition
|
Under review at Robotics and Autonomous Systems
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tactile sensing plays an irreplaceable role in robotic material recognition.
It enables robots to distinguish material properties such as their local
geometry and textures, especially for materials like textiles. However, most
tactile recognition methods can only classify known materials that have been
touched and trained with tactile data, yet cannot classify unknown materials
that are not trained with tactile data. To solve this problem, we propose a
tactile zero-shot learning framework to recognise unknown materials when they
are touched for the first time without requiring training tactile samples. The
visual modality, providing tactile cues from sight, and semantic attributes,
giving high-level characteristics, are combined together to bridge the gap
between touched classes and untouched classes. A generative model is learnt to
synthesise tactile features according to corresponding visual images and
semantic embeddings, and then a classifier can be trained using the synthesised
tactile features of untouched materials for zero-shot recognition. Extensive
experiments demonstrate that our proposed multimodal generative model can
achieve a high recognition accuracy of 83.06% in classifying materials that
were not touched before. The robotic experiment demo and the dataset are
available at https://sites.google.com/view/multimodalzsl.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 07:24:56 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Cao",
"Guanqun",
""
],
[
"Jiang",
"Jiaqi",
""
],
[
"Bollegala",
"Danushka",
""
],
[
"Li",
"Min",
""
],
[
"Luo",
"Shan",
""
]
] |
new_dataset
| 0.990166 |
2306.12759
|
Ana\"is Villedieu
|
Michael Huber, Martin N\"ollenburg, Ana\"is Villedieu
|
MySemCloud: Semantic-aware Word Cloud Editing
|
Appeared at PacificVis 2023
| null |
10.1109/PacificVis56936.2023.00024
| null |
cs.HC cs.GR
|
http://creativecommons.org/licenses/by/4.0/
|
Word clouds are a popular text visualization technique that summarize an
input text by displaying its most important words in a compact image. The
traditional layout methods do not take proximity effects between words into
account; this has been improved in semantic word clouds, where relative word
placement is controlled by edges in a word similarity graph. We introduce
MySemCloud, a new human-in-the-loop tool to visualize and edit semantic word
clouds. MySemCloud lets users perform computer-assisted local moves of words,
which improve or at least retain the semantic quality. To achieve this, we
construct a word similarity graph on which a system of forces is applied to
generate a compact initial layout with good semantic quality. The force system
also allows us to maintain these attributes after each user interaction, as
well as preserve the user's mental map. The tool provides algorithmic support
for the editing operations to help the user enhance the semantic quality of the
visualization, while adjusting it to their personal preference. We show that
MySemCloud provides high user satisfaction as well as permits users to create
layouts of higher quality than state-of-the-art semantic word cloud generation
tools.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 09:28:36 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Huber",
"Michael",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Villedieu",
"Anaïs",
""
]
] |
new_dataset
| 0.994038 |
2306.12785
|
Mohammad Reza Hasanabadi
|
Mohammad Reza Hasanabadi Majid Behdad Davood Gharavian
|
MFCCGAN: A Novel MFCC-Based Speech Synthesizer Using Adversarial
Learning
|
ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech
and Signal Processing (ICASSP)
| null |
10.1109/ICASSP49357.2023.10095873
| null |
cs.SD cs.AI eess.AS
|
http://creativecommons.org/publicdomain/zero/1.0/
|
In this paper, we introduce MFCCGAN as a novel speech synthesizer based on
adversarial learning that adopts MFCCs as input and generates raw speech
waveforms. Benefiting the GAN model capabilities, it produces speech with
higher intelligibility than a rule-based MFCC-based speech synthesizer WORLD.
We evaluated the model based on a popular intrusive objective speech
intelligibility measure (STOI) and quality (NISQA score). Experimental results
show that our proposed system outperforms Librosa MFCC- inversion (by an
increase of about 26% up to 53% in STOI and 16% up to 78% in NISQA score) and a
rise of about 10% in intelligibility and about 4% in naturalness in comparison
with conventional rule-based vocoder WORLD that used in the CycleGAN-VC family.
However, WORLD needs additional data like F0. Finally, using perceptual loss in
discriminators based on STOI could improve the quality more. WebMUSHRA-based
subjective tests also show the quality of the proposed approach.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 10:29:24 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Gharavian",
"Mohammad Reza Hasanabadi Majid Behdad Davood",
""
]
] |
new_dataset
| 0.993101 |
2306.12792
|
Shir Rorberg
|
Shir Rorberg, Amir Vaxman, Mirela Ben-Chen
|
BPM: Blended Piecewise Moebius Maps
| null | null | null | null |
cs.GR
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We propose a novel Moebius interpolator that takes as an input a discrete map
between the vertices of two planar triangle meshes, and outputs a smooth map on
the input domain. The output map interpolates the discrete map, is continuous
between triangles, and has low quasi-conformal distortion when the input map is
discrete conformal. Our map leads to considerably smoother texture transfer
compared to the alternatives, even on very coarse triangulations. Furthermore,
our approach has a closed-form expression, is local, applicable to any discrete
map, and leads to smooth results even for extreme deformations. Finally, by
working with local intrinsic coordinates, our approach is easily generalizable
to discrete maps between a surface triangle mesh and a planar mesh, i.e., a
planar parameterization. We compare our method with existing approaches, and
demonstrate better texture transfer results, and lower quasi-conformal errors.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 10:47:52 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Rorberg",
"Shir",
""
],
[
"Vaxman",
"Amir",
""
],
[
"Ben-Chen",
"Mirela",
""
]
] |
new_dataset
| 0.988633 |
2306.12819
|
Aya Mohamed
|
Aya Mohamed, Dagmar Auer, Daniel Hofer, Josef K\"ung
|
XACML Extension for Graphs: Flexible Authorization Policy Specification
and Datastore-independent Enforcement
|
Extended version of an accepted paper at the 20th International
Conference on Security and Cryptography (SECRYPT), 2023
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-nd/4.0/
|
The increasing use of graph-structured data for business- and
privacy-critical applications requires sophisticated, flexible and fine-grained
authorization and access control. Currently, role-based access control is
supported in graph databases, where access to objects is restricted via roles.
This does not take special properties of graphs into account such as vertices
and edges along the path between a given subject and resource. In previous
iterations of our research, we started to design an authorization policy
language and access control model, which considers the specification of graph
paths and enforces them in the multi-model database ArangoDB. Since this
approach is promising to consider graph characteristics in data protection, we
improve the language in this work to provide flexible path definitions and
specifying edges as protected resources. Furthermore, we introduce a method for
a datastore-independent policy enforcement. Besides discussing the latest work
in our XACML4G model, which is an extension to the Extensible Access Control
Markup Language (XACML), we demonstrate our prototypical implementation with a
real case and give an outlook on performance.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 11:35:22 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Mohamed",
"Aya",
""
],
[
"Auer",
"Dagmar",
""
],
[
"Hofer",
"Daniel",
""
],
[
"Küng",
"Josef",
""
]
] |
new_dataset
| 0.999091 |
2306.12845
|
Damien Chablat
|
Huiping Shen, Zhongqiu Du, Damien Chablat (LS2N - \'equipe ReV, LS2N),
Ju Li, Guanglei Wu
|
A new 3-DOF 2T1R parallel mechanism: Topology design and kinematics
|
IDETC-CIE 2023 International Design Engineering Technical Conferences
& Computers and Information in Engineering Conference, ASME, Aug 2023,
Boston, France
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents a new three-degree-of-freedom (3-DOF) parallel
mechanism (PM) with two translations and one rotation (2T1R), designed based on
the topological design theory of the parallel mechanism using position and
orientation characteristics (POC). The PM is primarily intended for use in
package sorting and delivery. The mobile platform of the PM moves along a
translation axis, picks up objects from a conveyor belt, and tilts them to
either side of the axis. We first calculate the PM's topological
characteristics, such as the degree of freedom (DOF) and the degree of
coupling, and provide its topological analytical formula to represent the
topological information of the PM. Next, we solve the direct and inverse
kinematic models based on the kinematic modelling principle using the
topological features. The models are purely analytic and are broken down into a
series of quadratic equations, making them suitable for use in an industrial
robot. We also study the singular configurations to identify the serial and
parallel singularities. Using the decoupling properties, we size the mechanism
to address the package sorting and depositing problem using an algebraic
approach. To determine the smallest segment lengths, we use a cylindrical
algebraic decomposition to solve a system with inequalities.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 12:34:30 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Shen",
"Huiping",
"",
"LS2N - équipe ReV, LS2N"
],
[
"Du",
"Zhongqiu",
"",
"LS2N - équipe ReV, LS2N"
],
[
"Chablat",
"Damien",
"",
"LS2N - équipe ReV, LS2N"
],
[
"Li",
"Ju",
""
],
[
"Wu",
"Guanglei",
""
]
] |
new_dataset
| 0.998752 |
2306.12925
|
Paul Rubenstein
|
Paul K. Rubenstein, Chulayuth Asawaroengchai, Duc Dung Nguyen, Ankur
Bapna, Zal\'an Borsos, F\'elix de Chaumont Quitry, Peter Chen, Dalia El
Badawy, Wei Han, Eugene Kharitonov, Hannah Muckenhirn, Dirk Padfield, James
Qin, Danny Rozenberg, Tara Sainath, Johan Schalkwyk, Matt Sharifi, Michelle
Tadmor Ramanovich, Marco Tagliasacchi, Alexandru Tudor, Mihajlo
Velimirovi\'c, Damien Vincent, Jiahui Yu, Yongqiang Wang, Vicky Zayats, Neil
Zeghidour, Yu Zhang, Zhishuai Zhang, Lukas Zilka, Christian Frank
|
AudioPaLM: A Large Language Model That Can Speak and Listen
|
Technical report
| null | null | null |
cs.CL cs.AI cs.SD eess.AS stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce AudioPaLM, a large language model for speech understanding and
generation. AudioPaLM fuses text-based and speech-based language models, PaLM-2
[Anil et al., 2023] and AudioLM [Borsos et al., 2022], into a unified
multimodal architecture that can process and generate text and speech with
applications including speech recognition and speech-to-speech translation.
AudioPaLM inherits the capability to preserve paralinguistic information such
as speaker identity and intonation from AudioLM and the linguistic knowledge
present only in text large language models such as PaLM-2. We demonstrate that
initializing AudioPaLM with the weights of a text-only large language model
improves speech processing, successfully leveraging the larger quantity of text
training data used in pretraining to assist with the speech tasks. The
resulting model significantly outperforms existing systems for speech
translation tasks and has the ability to perform zero-shot speech-to-text
translation for many languages for which input/target language combinations
were not seen in training. AudioPaLM also demonstrates features of audio
language models, such as transferring a voice across languages based on a short
spoken prompt. We release examples of our method at
https://google-research.github.io/seanet/audiopalm/examples
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 14:37:54 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Rubenstein",
"Paul K.",
""
],
[
"Asawaroengchai",
"Chulayuth",
""
],
[
"Nguyen",
"Duc Dung",
""
],
[
"Bapna",
"Ankur",
""
],
[
"Borsos",
"Zalán",
""
],
[
"Quitry",
"Félix de Chaumont",
""
],
[
"Chen",
"Peter",
""
],
[
"Badawy",
"Dalia El",
""
],
[
"Han",
"Wei",
""
],
[
"Kharitonov",
"Eugene",
""
],
[
"Muckenhirn",
"Hannah",
""
],
[
"Padfield",
"Dirk",
""
],
[
"Qin",
"James",
""
],
[
"Rozenberg",
"Danny",
""
],
[
"Sainath",
"Tara",
""
],
[
"Schalkwyk",
"Johan",
""
],
[
"Sharifi",
"Matt",
""
],
[
"Ramanovich",
"Michelle Tadmor",
""
],
[
"Tagliasacchi",
"Marco",
""
],
[
"Tudor",
"Alexandru",
""
],
[
"Velimirović",
"Mihajlo",
""
],
[
"Vincent",
"Damien",
""
],
[
"Yu",
"Jiahui",
""
],
[
"Wang",
"Yongqiang",
""
],
[
"Zayats",
"Vicky",
""
],
[
"Zeghidour",
"Neil",
""
],
[
"Zhang",
"Yu",
""
],
[
"Zhang",
"Zhishuai",
""
],
[
"Zilka",
"Lukas",
""
],
[
"Frank",
"Christian",
""
]
] |
new_dataset
| 0.989416 |
2306.12935
|
Simon Fowler
|
Simon Fowler, Duncan Paul Attard, Franciszek Sowul, Simon J. Gay, Phil
Trinder
|
Special Delivery: Programming with Mailbox Types (Extended Version)
|
Extended version of paper accepted to ICFP'23
| null | null | null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
The asynchronous and unidirectional communication model supported by
mailboxes is a key reason for the success of actor languages like Erlang and
Elixir for implementing reliable and scalable distributed systems. While many
actors may send messages to some actor, only the actor may (selectively)
receive from its mailbox. Although actors eliminate many of the issues stemming
from shared memory concurrency, they remain vulnerable to communication errors
such as protocol violations and deadlocks.
Mailbox types are a novel behavioural type system for mailboxes first
introduced for a process calculus by de'Liguoro and Padovani in 2018, which
capture the contents of a mailbox as a commutative regular expression. Due to
aliasing and nested evaluation contexts, moving from a process calculus to a
programming language is challenging.
This paper presents Pat, the first programming language design incorporating
mailbox types, and describes an algorithmic type system. We make essential use
of quasi-linear typing to tame some of the complexity introduced by aliasing.
Our algorithmic type system is necessarily co-contextual, achieved through a
novel use of backwards bidirectional typing, and we prove it sound and complete
with respect to our declarative type system. We implement a prototype type
checker, and use it to demonstrate the expressiveness of Pat on a factory
automation case study and a series of examples from the Savina actor benchmark
suite.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 14:48:48 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Fowler",
"Simon",
""
],
[
"Attard",
"Duncan Paul",
""
],
[
"Sowul",
"Franciszek",
""
],
[
"Gay",
"Simon J.",
""
],
[
"Trinder",
"Phil",
""
]
] |
new_dataset
| 0.959381 |
2306.12957
|
Luca Lanzend\"orfer
|
Luca A. Lanzend\"orfer, Roger Wattenhofer
|
Siamese SIREN: Audio Compression with Implicit Neural Representations
|
Published as a workshop paper at ICML 2023 neural compression
workshop
| null | null | null |
cs.SD cs.AI cs.LG eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Implicit Neural Representations (INRs) have emerged as a promising method for
representing diverse data modalities, including 3D shapes, images, and audio.
While recent research has demonstrated successful applications of INRs in image
and 3D shape compression, their potential for audio compression remains largely
unexplored. Motivated by this, we present a preliminary investigation into the
use of INRs for audio compression. Our study introduces Siamese SIREN, a novel
approach based on the popular SIREN architecture. Our experimental results
indicate that Siamese SIREN achieves superior audio reconstruction fidelity
while utilizing fewer network parameters compared to previous INR
architectures.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 15:16:06 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Lanzendörfer",
"Luca A.",
""
],
[
"Wattenhofer",
"Roger",
""
]
] |
new_dataset
| 0.98477 |
2306.12992
|
Kailun Yang
|
Qi Jiang, Shaohua Gao, Yao Gao, Kailun Yang, Zhonghua Yi, Hao Shi, Lei
Sun, Kaiwei Wang
|
Minimalist and High-Quality Panoramic Imaging with PSF-aware
Transformers
|
The dataset and code will be available at
https://github.com/zju-jiangqi/PCIE-PART
| null | null | null |
cs.CV eess.IV physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-quality panoramic images with a Field of View (FoV) of 360-degree are
essential for contemporary panoramic computer vision tasks. However,
conventional imaging systems come with sophisticated lens designs and heavy
optical components. This disqualifies their usage in many mobile and wearable
applications where thin and portable, minimalist imaging systems are desired.
In this paper, we propose a Panoramic Computational Imaging Engine (PCIE) to
address minimalist and high-quality panoramic imaging. With less than three
spherical lenses, a Minimalist Panoramic Imaging Prototype (MPIP) is
constructed based on the design of the Panoramic Annular Lens (PAL), but with
low-quality imaging results due to aberrations and small image plane size. We
propose two pipelines, i.e. Aberration Correction (AC) and Super-Resolution and
Aberration Correction (SR&AC), to solve the image quality problems of MPIP,
with imaging sensors of small and large pixel size, respectively. To provide a
universal network for the two pipelines, we leverage the information from the
Point Spread Function (PSF) of the optical system and design a PSF-aware
Aberration-image Recovery Transformer (PART), in which the self-attention
calculation and feature extraction are guided via PSF-aware mechanisms. We
train PART on synthetic image pairs from simulation and put forward the PALHQ
dataset to fill the gap of real-world high-quality PAL images for low-level
vision. A comprehensive variety of experiments on synthetic and real-world
benchmarks demonstrates the impressive imaging results of PCIE and the
effectiveness of plug-and-play PSF-aware mechanisms. We further deliver
heuristic experimental findings for minimalist and high-quality panoramic
imaging. Our dataset and code will be available at
https://github.com/zju-jiangqi/PCIE-PART.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 15:47:58 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Jiang",
"Qi",
""
],
[
"Gao",
"Shaohua",
""
],
[
"Gao",
"Yao",
""
],
[
"Yang",
"Kailun",
""
],
[
"Yi",
"Zhonghua",
""
],
[
"Shi",
"Hao",
""
],
[
"Sun",
"Lei",
""
],
[
"Wang",
"Kaiwei",
""
]
] |
new_dataset
| 0.997562 |
2306.13039
|
Omid Tavallaie
|
Omid Tavallaie, Seid Miad Zandavi, Hamed Haddadi, and Albert Y. Zomaya
|
GT-TSCH: Game-Theoretic Distributed TSCH Scheduler for Low-Power IoT
Networks
|
43rd IEEE International Conference on Distributed Computing Systems
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time-Slotted Channel Hopping (TSCH) is a synchronous medium access mode of
the IEEE 802.15.4e standard designed for providing low-latency and
highly-reliable end-to-end communication. TSCH constructs a communication
schedule by combining frequency channel hopping with Time Division Multiple
Access (TDMA). In recent years, IETF designed several standards to define
general mechanisms for the implementation of TSCH. However, the problem of
updating the TSCH schedule according to the changes of the wireless link
quality and node's traffic load left unresolved. In this paper, we use
non-cooperative game theory to propose GT-TSCH, a distributed TSCH scheduler
designed for low-power IoT applications. By considering selfish behavior of
nodes in packet forwarding, GT-TSCH updates the TSCH schedule in a distributed
approach with low control overhead by monitoring the queue length, the place of
the node in the Directed Acyclic Graph (DAG) topology, the quality of the
wireless link, and the data packet generation rate. We prove the existence and
uniqueness of Nash equilibrium in our game model and we find the optimal number
of TSCH Tx timeslots to update the TSCH slotframe. To examine the performance
of our contribution, we implement GT-TSCH on Zolertia Firefly IoT motes and the
Contiki-NG Operating System (OS). The evaluation results reveal that GT-TSCH
improves performance in terms of throughput and end-to-end delay compared to
the state-of-the-art method.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 17:01:59 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Tavallaie",
"Omid",
""
],
[
"Zandavi",
"Seid Miad",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Zomaya",
"Albert Y.",
""
]
] |
new_dataset
| 0.999517 |
2306.13053
|
Chung-Wei Lee
|
Chung-Wei Lee, Qinghua Liu, Yasin Abbasi-Yadkori, Chi Jin, Tor
Lattimore, Csaba Szepesv\'ari
|
Context-lumpable stochastic bandits
| null | null | null | null |
cs.LG
|
http://creativecommons.org/licenses/by/4.0/
|
We consider a contextual bandit problem with $S $ contexts and $A $ actions.
In each round $t=1,2,\dots$ the learner observes a random context and chooses
an action based on its past experience. The learner then observes a random
reward whose mean is a function of the context and the action for the round.
Under the assumption that the contexts can be lumped into $r\le \min\{S ,A \}$
groups such that the mean reward for the various actions is the same for any
two contexts that are in the same group, we give an algorithm that outputs an
$\epsilon$-optimal policy after using at most $\widetilde O(r (S +A
)/\epsilon^2)$ samples with high probability and provide a matching
$\widetilde\Omega(r (S +A )/\epsilon^2)$ lower bound. In the regret
minimization setting, we give an algorithm whose cumulative regret up to time
$T$ is bounded by $\widetilde O(\sqrt{r^3(S +A )T})$. To the best of our
knowledge, we are the first to show the near-optimal sample complexity in the
PAC setting and $\widetilde O(\sqrt{{poly}(r)(S+K)T})$ minimax regret in the
online setting for this problem. We also show our algorithms can be applied to
more general low-rank bandits and get improved regret bounds in some scenarios.
|
[
{
"version": "v1",
"created": "Thu, 22 Jun 2023 17:20:30 GMT"
}
] | 2023-06-23T00:00:00 |
[
[
"Lee",
"Chung-Wei",
""
],
[
"Liu",
"Qinghua",
""
],
[
"Abbasi-Yadkori",
"Yasin",
""
],
[
"Jin",
"Chi",
""
],
[
"Lattimore",
"Tor",
""
],
[
"Szepesvári",
"Csaba",
""
]
] |
new_dataset
| 0.984112 |
1212.0020
|
Dan HERNEST gm
|
Dan Hernest and Trifon Trifonov
|
Modal Functional (Dialectica) Interpretation
| null |
Logical Methods in Computer Science, Volume 17, Issue 4 (October
25, 2021) lmcs:7132
|
10.46298/lmcs-17(4:3)2021
| null |
cs.LO math.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We adapt our light Dialectica interpretation to usual and light modal
formulas (with universal quantification on boolean and natural variables) and
prove it sound for a non-standard modal arithmetic based on Goedel's T and
classical S4. The range of this light modal Dialectica is the usual (non-modal)
classical Arithmetic in all finite types (with booleans); the propositional
kernel of its domain is Boolean and not S4. The `heavy' modal Dialectica
interpretation is a new technique, as it cannot be simulated within our
previous light Dialectica. The synthesized functionals are at least as good as
before, while the translation process is improved. Through our modal
Dialectica, the existence of a realizer for the defining axiom of classical S5
reduces to the Drinking Principle (cf. Smullyan).
|
[
{
"version": "v1",
"created": "Fri, 30 Nov 2012 21:32:52 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Apr 2013 08:58:08 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Mar 2015 02:21:54 GMT"
},
{
"version": "v4",
"created": "Fri, 11 Sep 2015 16:37:30 GMT"
},
{
"version": "v5",
"created": "Wed, 20 Jan 2021 19:08:12 GMT"
},
{
"version": "v6",
"created": "Tue, 31 Aug 2021 16:02:47 GMT"
},
{
"version": "v7",
"created": "Tue, 21 Sep 2021 13:59:02 GMT"
},
{
"version": "v8",
"created": "Fri, 22 Oct 2021 17:03:57 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Hernest",
"Dan",
""
],
[
"Trifonov",
"Trifon",
""
]
] |
new_dataset
| 0.989711 |
1404.4250
|
Dmitry N. Kozlov
|
Dmitry N. Kozlov
|
Witness structures and immediate snapshot complexes
|
full paper version of the 1st part of the preprint arXiv:1402.4707;
to appear in DMTCS
|
Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
3, Distributed Computing and Networking (November 28, 2017) dmtcs:3122
|
10.23638/DMTCS-19-3-12
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce and study a new family of combinatorial simplicial
complexes, which we call immediate snapshot complexes. Our construction and
terminology is strongly motivated by theoretical distributed computing, as
these complexes are combinatorial models of the standard protocol complexes
associated to immediate snapshot read/write shared memory communication model.
In order to define the immediate snapshot complexes we need a new combinatorial
object, which we call a witness structure. These objects are indexing the
simplices in the immediate snapshot complexes, while a special operation on
them, called ghosting, describes the combinatorics of taking simplicial
boundary. In general, we develop the theory of witness structures and use it to
prove several combinatorial as well as topological properties of the immediate
snapshot complexes.
|
[
{
"version": "v1",
"created": "Wed, 16 Apr 2014 14:06:12 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Nov 2015 11:29:40 GMT"
},
{
"version": "v3",
"created": "Sun, 5 Feb 2017 08:39:38 GMT"
},
{
"version": "v4",
"created": "Fri, 24 Nov 2017 13:13:08 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Kozlov",
"Dmitry N.",
""
]
] |
new_dataset
| 0.979009 |
1404.7458
|
Daniel Krenn
|
Clemens Heuberger, Daniel Krenn, Sara Kropf
|
Automata in SageMath---Combinatorics meet Theoretical Computer Science
| null |
Discrete Mathematics & Theoretical Computer Science, Vol. 18 no.
3, Analysis of Algorithms (May 10, 2016) dmtcs:1352
|
10.46298/dmtcs.1352
| null |
cs.FL math.CO
|
http://creativecommons.org/licenses/by/4.0/
|
The new finite state machine package in the mathematics software system
SageMath is presented and illustrated by many examples. Several combinatorial
problems, in particular digit problems, are introduced, modeled by automata and
transducers and solved using SageMath. In particular, we compute the asymptotic
Hamming weight of a non-adjacent-form-like digit expansion, which was not known
before.
|
[
{
"version": "v1",
"created": "Tue, 29 Apr 2014 18:56:19 GMT"
},
{
"version": "v2",
"created": "Tue, 12 Jan 2016 10:08:19 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Apr 2016 12:29:53 GMT"
},
{
"version": "v4",
"created": "Thu, 5 May 2016 17:46:57 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Heuberger",
"Clemens",
""
],
[
"Krenn",
"Daniel",
""
],
[
"Kropf",
"Sara",
""
]
] |
new_dataset
| 0.998504 |
1407.0334
|
Abuzer Yakaryilmaz
|
G\"okalp Demirci and Mika Hirvensalo and Klaus Reinhardt and A. C. Cem
Say and Abuzer Yakary{\i}lmaz
|
Alternating, private alternating, and quantum alternating realtime
automata
| null |
Logical Methods in Computer Science, Volume 15, Issue 3 (August
28, 2019) lmcs:4664
|
10.23638/LMCS-15(3:22)2019
| null |
cs.FL cs.CC cs.LO quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
We present new results on realtime alternating, private alternating, and
quantum alternating automaton models. Firstly, we show that the emptiness
problem for alternating one-counter automata on unary alphabets is undecidable.
Then, we present two equivalent definitions of realtime private alternating
finite automata (PAFAs). We show that the emptiness problem is undecidable for
PAFAs. Furthermore, PAFAs can recognize some nonregular unary languages,
including the unary squares language, which seems to be difficult even for some
classical counter automata with two-way input. Regarding quantum finite
automata (QFAs), we show that the emptiness problem is undecidable both for
universal QFAs on general alphabets, and for alternating QFAs with two
alternations on unary alphabets. On the other hand, the same problem is
decidable for nondeterministic QFAs on general alphabets. We also show that the
unary squares language is recognized by alternating QFAs with two alternations.
|
[
{
"version": "v1",
"created": "Tue, 1 Jul 2014 17:52:47 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Jun 2018 19:41:14 GMT"
},
{
"version": "v3",
"created": "Tue, 12 Mar 2019 10:26:09 GMT"
},
{
"version": "v4",
"created": "Mon, 29 Jul 2019 08:15:53 GMT"
},
{
"version": "v5",
"created": "Tue, 27 Aug 2019 10:48:22 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Demirci",
"Gökalp",
""
],
[
"Hirvensalo",
"Mika",
""
],
[
"Reinhardt",
"Klaus",
""
],
[
"Say",
"A. C. Cem",
""
],
[
"Yakaryılmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.992064 |
1409.7542
|
Pierre Clairambault
|
Simon Castellan (LIP), Pierre Clairambault (LIP, PLUME), Glynn Winskel
|
Thin Games with Symmetry and Concurrent Hyland-Ong Games
| null |
Logical Methods in Computer Science, Volume 15, Issue 1 (March 4,
2019) lmcs:3891
|
10.23638/LMCS-15(1:18)2019
| null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We build a cartesian closed category, called Cho, based on event structures.
It allows an interpretation of higher-order stateful concurrent programs that
is refined and precise: on the one hand it is conservative with respect to
standard Hyland-Ong games when interpreting purely functional programs as
innocent strategies, while on the other hand it is much more expressive. The
interpretation of programs constructs compositionally a representation of their
execution that exhibits causal dependencies and remembers the points of
non-deterministic branching.The construction is in two stages. First, we build
a compact closed category Tcg. It is a variant of Rideau and Winskel's category
CG, with the difference that games and strategies in Tcg are equipped with
symmetry to express that certain events are essentially the same. This is
analogous to the underlying category of AJM games enriching simple games with
an equivalence relations on plays. Building on this category, we construct the
cartesian closed category Cho as having as objects the standard arenas of
Hyland-Ong games, with strategies, represented by certain events structures,
playing on games with symmetry obtained as expanded forms of these arenas.To
illustrate and give an operational light on these constructions, we interpret
(a close variant of) Idealized Parallel Algol in Cho.
|
[
{
"version": "v1",
"created": "Fri, 26 Sep 2014 11:39:59 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Jan 2017 15:32:10 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Aug 2017 09:05:16 GMT"
},
{
"version": "v4",
"created": "Thu, 20 Dec 2018 09:48:49 GMT"
},
{
"version": "v5",
"created": "Fri, 1 Mar 2019 15:33:48 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Castellan",
"Simon",
"",
"LIP"
],
[
"Clairambault",
"Pierre",
"",
"LIP, PLUME"
],
[
"Winskel",
"Glynn",
""
]
] |
new_dataset
| 0.998144 |
1510.08566
|
J\"urgen Koslowski
|
Giorgi Japaridze (Department of Computing Sciences, Villanova
University)
|
Build your own clarithmetic II: Soundness
| null |
Logical Methods in Computer Science, Volume 12, Issue 3 (April 27,
2017) lmcs:2028
|
10.2168/LMCS-12(3:12)2016
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Clarithmetics are number theories based on computability logic (see
http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories
represent interactive computational problems, and their "truth" is understood
as existence of an algorithmic solution. Various complexity constraints on such
solutions induce various versions of clarithmetic. The present paper introduces
a parameterized/schematic version CLA11(P1,P2,P3,P4). By tuning the three
parameters P1,P2,P3 in an essentially mechanical manner, one automatically
obtains sound and complete theories with respect to a wide range of target
tricomplexity classes, i.e. combinations of time (set by P3), space (set by P2)
and so called amplitude (set by P1) complexities. Sound in the sense that every
theorem T of the system represents an interactive number-theoretic
computational problem with a solution from the given tricomplexity class and,
furthermore, such a solution can be automatically extracted from a proof of T.
And complete in the sense that every interactive number-theoretic problem with
a solution from the given tricomplexity class is represented by some theorem of
the system. Furthermore, through tuning the 4th parameter P4, at the cost of
sacrificing recursive axiomatizability but not simplicity or elegance, the
above extensional completeness can be strengthened to intensional completeness,
according to which every formula representing a problem with a solution from
the given tricomplexity class is a theorem of the system. This article is
published in two parts. The previous Part I has introduced the system and
proved its completeness, while the present Part II is devoted to proving
soundness.
|
[
{
"version": "v1",
"created": "Thu, 29 Oct 2015 05:33:15 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Jun 2016 12:21:10 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Aug 2016 11:04:23 GMT"
},
{
"version": "v4",
"created": "Wed, 21 Sep 2016 13:46:11 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Japaridze",
"Giorgi",
"",
"Department of Computing Sciences, Villanova\n University"
]
] |
new_dataset
| 0.997678 |
1511.01807
|
Thorsten Wissmann
|
Prateek Karandikar and Philippe Schnoebelen
|
The height of piecewise-testable languages and the complexity of the
logic of subwords
|
This article is a full version of "The height of piecewise-testable
languages with applications in logical complexity", in Proc. CSL 2016, LIPiCS
62:37
|
Logical Methods in Computer Science, Volume 15, Issue 2 (April 30,
2019) lmcs:4850
|
10.23638/LMCS-15(2:6)2019
| null |
cs.LO cs.FL
|
http://creativecommons.org/licenses/by/4.0/
|
The height of a piecewise-testable language $L$ is the maximum length of the
words needed to define $L$ by excluding and requiring given subwords. The
height of $L$ is an important descriptive complexity measure that has not yet
been investigated in a systematic way. This article develops a series of new
techniques for bounding the height of finite languages and of languages
obtained by taking closures by subwords, superwords and related operations.
As an application of these results, we show that
$\mathsf{FO}^2(A^*,\sqsubseteq)$, the two-variable fragment of the first-order
logic of sequences with the subword ordering, can only express
piecewise-testable properties and has elementary complexity.
|
[
{
"version": "v1",
"created": "Thu, 5 Nov 2015 16:45:19 GMT"
},
{
"version": "v2",
"created": "Fri, 8 Jul 2016 09:54:48 GMT"
},
{
"version": "v3",
"created": "Thu, 20 Sep 2018 18:09:58 GMT"
},
{
"version": "v4",
"created": "Sun, 28 Apr 2019 13:39:56 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Karandikar",
"Prateek",
""
],
[
"Schnoebelen",
"Philippe",
""
]
] |
new_dataset
| 0.994509 |
1511.07180
|
Florin Manea
|
Marius Dumitran, Pawe{\l} Gawrychowski and Florin Manea
|
Longest Gapped Repeats and Palindromes
|
This is an extension of the conference papers "Longest
$\alpha$-Gapped Repeat and Palindrome", presented by the second and third
authors at FCT 2015, and "Longest Gapped Repeats and Palindromes", presented
by the first and third authors at MFCS 2015
|
Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
4, FCT '15, special issue FCT'15 (October 13, 2017) dmtcs:1337
|
10.23638/DMTCS-19-4-4
| null |
cs.DS
|
http://creativecommons.org/licenses/by/4.0/
|
A gapped repeat (respectively, palindrome) occurring in a word $w$ is a
factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$
is called the arm of the repeat (respectively, palindrome), while $v$ is called
the gap. We show how to compute efficiently, for every position $i$ of the word
$w$, the longest gapped repeat and palindrome occurring at that position,
provided that the length of the gap is subject to various types of
restrictions. That is, that for each position $i$ we compute the longest prefix
$u$ of $w[i..n]$ such that $uv$ (respectively, $u^Rv$) is a suffix of
$w[1..i-1]$ (defining thus a gapped repeat $uvu$ -- respectively, palindrome
$u^Rvu$), and the length of $v$ is subject to the aforementioned restrictions.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2015 11:19:00 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Feb 2017 17:50:14 GMT"
},
{
"version": "v3",
"created": "Thu, 29 Jun 2017 15:02:47 GMT"
},
{
"version": "v4",
"created": "Wed, 11 Oct 2017 09:40:01 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Dumitran",
"Marius",
""
],
[
"Gawrychowski",
"Paweł",
""
],
[
"Manea",
"Florin",
""
]
] |
new_dataset
| 0.999638 |
1512.06788
|
Victor Yodaiken
|
Victor Yodaiken
|
State machines for large scale computer software and systems
|
This is a duplicate
| null | null | null |
cs.FL
|
http://creativecommons.org/licenses/by-nc-nd/4.0/
|
This paper introduces techniques for specifying behavior, architecture, and
abstract properties of large scale computer software and hardware purely in
terms of ordinary deterministic state machines. The goal is to be able to work
with specifications ranging from operating systems to databases and real-time
control. State machines with output are represented as maps from finite
sequences of events to outputs so that f(s) is the output in the state reached
by following s from a initial state. Composite sequence maps correspond to
state machine products. The methods used here can specify or constrain both
system behavior and system design. Motivating examples presented range from
simple counters to distributed consensus algorithms and real-time circuits. The
approach is intended to facilitate "back of the envelope" descriptions of
devices and software and also to allow for detailed hierarchical specifications
of behavior and architecture.
The mathematical approach is based on both primitive recursion on sequences
\cite{PeterComputer} and automata products with feedback \cite{Gecseg}, adapted
to Moore type state machines. No formal methods or other metamathematical
techniques are employed and although parallel and concurrent composite systems
are easy to specify, it is not necessary to make any particular communication
scheme primitive. State machines are not augmented or extended - even the most
complex composite systems are modeled by ordinary deterministic state machines
which have a rich mathematical theory related to semigroups.
|
[
{
"version": "v1",
"created": "Mon, 21 Dec 2015 19:58:09 GMT"
},
{
"version": "v2",
"created": "Sat, 20 Feb 2016 21:49:57 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Jan 2022 22:09:17 GMT"
},
{
"version": "v4",
"created": "Wed, 21 Jun 2023 08:36:06 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Yodaiken",
"Victor",
""
]
] |
new_dataset
| 0.995814 |
1602.04860
|
Thorsten Wissmann
|
G. A. Kavvos
|
Dual-Context Calculi for Modal Logic
|
Full version of article previously presented at LICS 2017 (see
arXiv:1602.04860v4 or doi: 10.1109/LICS.2017.8005089)
|
Logical Methods in Computer Science, Volume 16, Issue 3 (August
19, 2020) lmcs:4740
|
10.23638/LMCS-16(3:10)2020
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We present natural deduction systems and associated modal lambda calculi for
the necessity fragments of the normal modal logics K, T, K4, GL and S4. These
systems are in the dual-context style: they feature two distinct zones of
assumptions, one of which can be thought as modal, and the other as
intuitionistic. We show that these calculi have their roots in in sequent
calculi. We then investigate their metatheory, equip them with a confluent and
strongly normalizing notion of reduction, and show that they coincide with the
usual Hilbert systems up to provability. Finally, we investigate a categorical
semantics which interprets the modality as a product-preserving functor.
|
[
{
"version": "v1",
"created": "Mon, 15 Feb 2016 23:03:24 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Jan 2017 13:03:59 GMT"
},
{
"version": "v3",
"created": "Fri, 3 Mar 2017 16:21:21 GMT"
},
{
"version": "v4",
"created": "Wed, 16 Aug 2017 00:04:52 GMT"
},
{
"version": "v5",
"created": "Sun, 5 Aug 2018 00:13:05 GMT"
},
{
"version": "v6",
"created": "Mon, 30 Mar 2020 15:55:37 GMT"
},
{
"version": "v7",
"created": "Sun, 2 Aug 2020 14:14:00 GMT"
},
{
"version": "v8",
"created": "Tue, 18 Aug 2020 13:43:05 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Kavvos",
"G. A.",
""
]
] |
new_dataset
| 0.999521 |
1607.03286
|
Christoph Rauch
|
Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, and Xiaoyong Xi
|
The Ho-Zhao Problem
|
19 pages, 4 figures
|
Logical Methods in Computer Science, Volume 14, Issue 1 (January
17, 2018) lmcs:1529
|
10.23638/LMCS-14(1:7)2018
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Given a poset $P$, the set, $\Gamma(P)$, of all Scott closed sets ordered by
inclusion forms a complete lattice. A subcategory $\mathbf{C}$ of
$\mathbf{Pos}_d$ (the category of posets and Scott-continuous maps) is said to
be $\Gamma$-faithful if for any posets $P$ and $Q$ in $\mathbf{C}$, $\Gamma(P)
\cong \Gamma(Q)$ implies $P \cong Q$. It is known that the category of all
continuous dcpos and the category of bounded complete dcpos are
$\Gamma$-faithful, while $\mathbf{Pos}_d$ is not. Ho & Zhao (2009) asked
whether the category $\mathbf{DCPO}$ of dcpos is $\Gamma$-faithful. In this
paper, we answer this question in the negative by exhibiting a counterexample.
To achieve this, we introduce a new subcategory of dcpos which is
$\Gamma$-faithful. This subcategory subsumes all currently known
$\Gamma$-faithful subcategories. With this new concept in mind, we construct
the desired counterexample which relies heavily on Johnstone's famous dcpo
which is not sober in its Scott topology.
|
[
{
"version": "v1",
"created": "Tue, 12 Jul 2016 09:43:22 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Dec 2017 15:31:03 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Jan 2018 16:00:29 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Ho",
"Weng Kin",
""
],
[
"Goubault-Larrecq",
"Jean",
""
],
[
"Jung",
"Achim",
""
],
[
"Xi",
"Xiaoyong",
""
]
] |
new_dataset
| 0.98272 |
1609.05792
|
Christopher Duffy
|
C. Duffy, T.F. Lidbetter, M.E. Messinger, R.J. Nowakowski
|
A Variation on Chip-Firing: the diffusion game
|
18 pages, 3 figures
|
Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
1, Graph Theory (January 17, 2018) dmtcs:2039
|
10.23638/DMTCS-20-1-4
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a natural variant of the parallel chip-firing game, called the
diffusion game. Chips are initially assigned to vertices of a graph. At every
step, all vertices simultaneously send one chip to each neighbour with fewer
chips. As the dynamics of the parallel chip-firing game occur on a finite set
the process is inherently periodic. However the diffusion game is not obviously
periodic: even if $2|E(G)|$ chips are assigned to vertices of graph G, there
may exist time steps where some vertices have a negative number of chips. We
investigate the process, prove periodicity for a number of graph classes, and
pose some questions for future research.
|
[
{
"version": "v1",
"created": "Mon, 19 Sep 2016 15:42:33 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Apr 2017 00:06:38 GMT"
},
{
"version": "v3",
"created": "Thu, 14 Dec 2017 17:15:59 GMT"
},
{
"version": "v4",
"created": "Tue, 9 Jan 2018 19:59:56 GMT"
},
{
"version": "v5",
"created": "Mon, 15 Jan 2018 16:54:56 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Duffy",
"C.",
""
],
[
"Lidbetter",
"T. F.",
""
],
[
"Messinger",
"M. E.",
""
],
[
"Nowakowski",
"R. J.",
""
]
] |
new_dataset
| 0.998109 |
1610.05115
|
Timothy Highley Jr.
|
Timothy Highley, Hoang Le
|
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter
Exchange with Multiple Items Per Agent
|
Published in Discrete Mathematics and Theoretical Computer Science
|
Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
2, Analysis of Algorithms (July 31, 2018) dmtcs:3186
|
10.23638/DMTCS-20-2-1
| null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a barter exchange market, agents bring items and seek to exchange their
items with one another. Agents may agree to a k-way exchange involving a cycle
of k agents. A barter exchange market can be represented by a digraph where the
vertices represent items and the edges out of a vertex indicate the items that
an agent is willing to accept in exchange for that item. It is known that the
problem of finding a set of vertex-disjoint cycles with the maximum total
number of vertices (MAX-SIZE-EXCHANGE) can be solved in polynomial time. We
consider a barter exchange where each agent may bring multiple items, and items
of the same agent are represented by vertices with the same color. A set of
cycles is said to be tropical if for every color there is a cycle that contains
a vertex of that color. We show that the problem of determining whether there
exists a tropical set of vertex-disjoint cycles in a digraph
(TROPICAL-EXCHANGE) is NP-complete and APX-hard. This is equivalent to
determining whether it is possible to arrange an exchange of items among agents
such that every agent trades away at least one item. TROPICAL-MAX-SIZE-EXCHANGE
is a similar problem, where the goal is to find a set of vertex-disjoint cycles
that contains the maximum number of vertices and also contains all of the
colors in the graph. We show that this problem is likewise NP-complete and
APX-hard. For the restricted case where there are at most two vertices of each
color (corresponding to a restriction that each agent may bring at most two
items), both problems remain NP-hard but are in APX. Finally, we consider
MAX-SIZE-TROPICAL-EXCHANGE, where the set of cycles must primarily include as
many colors as possible and secondarily include as many vertices as possible.
We show that this problem is NP-hard.
|
[
{
"version": "v1",
"created": "Fri, 14 Oct 2016 01:10:21 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Mar 2017 18:25:43 GMT"
},
{
"version": "v3",
"created": "Thu, 3 Aug 2017 20:16:11 GMT"
},
{
"version": "v4",
"created": "Fri, 6 Apr 2018 21:54:41 GMT"
},
{
"version": "v5",
"created": "Wed, 18 Jul 2018 03:36:20 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Highley",
"Timothy",
""
],
[
"Le",
"Hoang",
""
]
] |
new_dataset
| 0.99973 |
1611.05672
|
Thorsten Wissmann
|
Andrej Dudenhefner, Moritz Martens, Jakob Rehof
|
The Algebraic Intersection Type Unification Problem
| null |
Logical Methods in Computer Science, Volume 13, Issue 3 (August
15, 2017) lmcs:2543
|
10.23638/LMCS-13(3:9)2017
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The algebraic intersection type unification problem is an important component
in proof search related to several natural decision problems in intersection
type systems. It is unknown and remains open whether the algebraic intersection
type unification problem is decidable. We give the first nontrivial lower bound
for the problem by showing (our main result) that it is exponential time hard.
Furthermore, we show that this holds even under rank 1 solutions (substitutions
whose codomains are restricted to contain rank 1 types). In addition, we
provide a fixed-parameter intractability result for intersection type matching
(one-sided unification), which is known to be NP-complete.
We place the algebraic intersection type unification problem in the context
of unification theory. The equational theory of intersection types can be
presented as an algebraic theory with an ACI (associative, commutative, and
idempotent) operator (intersection type) combined with distributivity
properties with respect to a second operator (function type). Although the
problem is algebraically natural and interesting, it appears to occupy a
hitherto unstudied place in the theory of unification, and our investigation of
the problem suggests that new methods are required to understand the problem.
Thus, for the lower bound proof, we were not able to reduce from known results
in ACI-unification theory and use game-theoretic methods for two-player tiling
games.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 13:13:18 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Nov 2016 08:50:51 GMT"
},
{
"version": "v3",
"created": "Wed, 26 Apr 2017 11:31:52 GMT"
},
{
"version": "v4",
"created": "Tue, 20 Jun 2017 21:24:17 GMT"
},
{
"version": "v5",
"created": "Mon, 14 Aug 2017 09:32:51 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Dudenhefner",
"Andrej",
""
],
[
"Martens",
"Moritz",
""
],
[
"Rehof",
"Jakob",
""
]
] |
new_dataset
| 0.988934 |
1611.08738
|
Thorsten Wissmann
|
Georgios Kourtis, Ian Pratt-Hartmann
|
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment
with Counting
| null |
Logical Methods in Computer Science, Volume 13, Issue 4 (October
30, 2017) lmcs:2557
|
10.23638/LMCS-13(4:4)2017
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The satisfiability and finite satisfiability problems for the two-variable
guarded fragment of first-order logic with counting quantifiers, a database,
and path-functional dependencies are both ExpTime-complete.
|
[
{
"version": "v1",
"created": "Sat, 26 Nov 2016 20:15:47 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Jun 2017 13:26:56 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Oct 2017 08:53:22 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Kourtis",
"Georgios",
""
],
[
"Pratt-Hartmann",
"Ian",
""
]
] |
new_dataset
| 0.962901 |
1611.08800
|
Ale\v{s} Bizjak
|
Davide Bresolin, Emilio Mu\~noz-Velasco, Guido Sciavicco
|
On Sub-Propositional Fragments of Modal Logic
| null |
Logical Methods in Computer Science, Volume 14, Issue 2 (June 22,
2018) lmcs:2550
|
10.23638/LMCS-14(2:16)2018
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we consider the well-known modal logics $\mathbf{K}$,
$\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their
sub-propositional fragments, namely the classical Horn fragment, the Krom
fragment, the so-called core fragment, defined as the intersection of the Horn
and the Krom fragments, plus their sub-fragments obtained by limiting the use
of boxes and diamonds in clauses. We focus, first, on the relative expressive
power of such languages: we introduce a suitable measure of expressive power,
and we obtain a complex hierarchy that encompasses all fragments of the
considered logics. Then, after observing the low expressive power, in
particular, of the Horn fragments without diamonds, we study the computational
complexity of their satisfiability problem, proving that, in general, it
becomes polynomial.
|
[
{
"version": "v1",
"created": "Sun, 27 Nov 2016 07:41:06 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Jul 2017 15:24:40 GMT"
},
{
"version": "v3",
"created": "Fri, 2 Feb 2018 14:06:22 GMT"
},
{
"version": "v4",
"created": "Thu, 21 Jun 2018 16:03:13 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Bresolin",
"Davide",
""
],
[
"Muñoz-Velasco",
"Emilio",
""
],
[
"Sciavicco",
"Guido",
""
]
] |
new_dataset
| 0.999014 |
1611.09633
|
Christoph Rauch
|
Dmitriy Traytel
|
Formal Languages, Formally and Coinductively
|
Extended version of homonymous FSCD 2016 paper
|
Logical Methods in Computer Science, Volume 13, Issue 3 (September
19, 2017) lmcs:2564
|
10.23638/LMCS-13(3:28)2017
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditionally, formal languages are defined as sets of words. More recently,
the alternative coalgebraic or coinductive representation as infinite tries,
i.e., prefix trees branching over the alphabet, has been used to obtain compact
and elegant proofs of classic results in language theory. In this article, we
study this representation in the Isabelle proof assistant. We define regular
operations on infinite tries and prove the axioms of Kleene algebra for those
operations. Thereby, we exercise corecursion and coinduction and confirm the
coinductive view being profitable in formalizations, as it improves over the
set-of-words view with respect to proof automation.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 13:56:39 GMT"
},
{
"version": "v2",
"created": "Sat, 13 May 2017 22:58:31 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Sep 2017 12:53:01 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Traytel",
"Dmitriy",
""
]
] |
new_dataset
| 0.955852 |
1611.09907
|
Haiko M\"uller
|
Isolde Adler, Ngoc Khang Le, Haiko M\"uller, Marko Radovanovi\'c,
Nicolas Trotignon, Kristina Vu\v{s}kovi\'c
|
On rank-width of even-hole-free graphs
|
12 pages, 2 figures
|
Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
1, Graph Theory (October 5, 2017) dmtcs:2575
|
10.23638/DMTCS-19-1-24
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a class of (diamond, even hole)-free graphs with no clique cutset
that has unbounded rank-width. In general, even-hole-free graphs have unbounded
rank-width, because chordal graphs are even-hole-free. A.A. da Silva, A. Silva
and C. Linhares-Sales (2010) showed that planar even-hole-free graphs have
bounded rank-width, and N.K. Le (2016) showed that even-hole-free graphs with
no star cutset have bounded rank-width. A natural question is to ask, whether
even-hole-free graphs with no clique cutsets have bounded rank-width. Our
result gives a negative answer. Hence we cannot apply Courcelle and Makowsky's
meta-theorem which would provide efficient algorithms for a large number of
problems, including the maximum independent set problem, whose complexity
remains open for (diamond, even hole)-free graphs.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 21:56:38 GMT"
},
{
"version": "v2",
"created": "Mon, 31 Jul 2017 10:49:47 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Sep 2017 12:56:36 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Adler",
"Isolde",
""
],
[
"Le",
"Ngoc Khang",
""
],
[
"Müller",
"Haiko",
""
],
[
"Radovanović",
"Marko",
""
],
[
"Trotignon",
"Nicolas",
""
],
[
"Vušković",
"Kristina",
""
]
] |
new_dataset
| 0.973908 |
1611.10208
|
Konstantinos Georgiou
|
Konstantinos Georgiou, George Karakostas, Evangelos Kranakis
|
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face
Communication Models
|
26 Pages, 6 Figures. This is the full version of the paper with the
same title which will appear in the proceedings of the 6th International
Conference on Operations Research and Enterprise Systems (ICORES), February
23-25, 2017, Porto, Portugal
|
Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
, Distributed Computing and Networking (June 13, 2019) dmtcs:4884
|
10.23638/DMTCS-21-3-20
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We initiate the study of a new problem on searching and fetching in a
distributed environment concerning treasure-evacuation from a unit disk. A
treasure and an exit are located at unknown positions on the perimeter of a
disk and at known arc distance. A team of two robots start from the center of
the disk, and their goal is to fetch the treasure to the exit. At any time the
robots can move anywhere they choose on the disk, independently of each other,
with the same speed. A robot detects an interesting point (treasure or exit)
only if it passes over the exact location of that point. We are interested in
designing distributed algorithms that minimize the worst-case
treasure-evacuation time, i.e. the time it takes for the treasure to be
discovered and brought (fetched) to the exit by any of the robots.
The communication protocol between the robots is either wireless, where
information is shared at any time, or face-to-face (i.e. non-wireless), where
information can be shared only if the robots meet. For both models we obtain
upper bounds for fetching the treasure to the exit. Our main technical
contribution pertains to the face-to-face model. More specifically, we
demonstrate how robots can exchange information without meeting, effectively
achieving a highly efficient treasure-evacuation protocol which is minimally
affected by the lack of distant communication. Finally, we complement our
positive results above by providing a lower bound in the face-to-face model.
|
[
{
"version": "v1",
"created": "Wed, 30 Nov 2016 15:13:11 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Oct 2018 15:04:04 GMT"
},
{
"version": "v3",
"created": "Thu, 11 Oct 2018 13:54:27 GMT"
},
{
"version": "v4",
"created": "Thu, 23 May 2019 15:47:16 GMT"
},
{
"version": "v5",
"created": "Fri, 24 May 2019 17:29:30 GMT"
},
{
"version": "v6",
"created": "Wed, 29 May 2019 20:47:51 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Georgiou",
"Konstantinos",
""
],
[
"Karakostas",
"George",
""
],
[
"Kranakis",
"Evangelos",
""
]
] |
new_dataset
| 0.951427 |
1702.01804
|
Christoph Rauch
|
Paul Brunet and Damien Pous
|
Petri Automata
| null |
Logical Methods in Computer Science, Volume 13, Issue 3 (September
26, 2017) lmcs:3125
|
10.23638/LMCS-13(3:33)2017
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Kleene algebra axioms are complete with respect to both language models and
binary relation models. In particular, two regular expressions recognise the
same language if and only if they are universally equivalent in the model of
binary relations. We consider Kleene allegories, i.e., Kleene algebras with two
additional operations and a constant which are natural in binary relation
models: intersection, converse, and the full relation. While regular languages
are closed under those operations, the above characterisation breaks. Putting
together a few results from the literature, we give a characterisation in terms
of languages of directed and labelled graphs. By taking inspiration from Petri
nets, we design a finite automata model, Petri automata, allowing to recognise
such graphs. We prove a Kleene theorem for this automata model: the sets of
graphs recognisable by Petri automata are precisely the sets of graphs
definable through the extended regular expressions we consider. Petri automata
allow us to obtain decidability of identity-free relational Kleene lattices,
i.e., the equational theory generated by binary relations on the signature of
regular expressions with intersection, but where one forbids unit. This
restriction is used to ensure that the corresponding graphs are acyclic. We
actually show that this decision problem is EXPSPACE-complete.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 21:58:26 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Aug 2017 09:49:13 GMT"
},
{
"version": "v3",
"created": "Mon, 25 Sep 2017 16:35:36 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Brunet",
"Paul",
""
],
[
"Pous",
"Damien",
""
]
] |
new_dataset
| 0.98964 |
1702.08841
|
Luca Reggio
|
Mai Gehrke, Daniela Petrisan, Luca Reggio
|
Quantifiers on languages and codensity monads
|
30 pages. Presentation improved and details of several proofs added.
The main results are unchanged
|
Math. Struct. Comp. Sci. 30 (2020) 1054-1088
|
10.1017/S0960129521000074
| null |
cs.LO cs.FL math.CT math.GN math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper contributes to the techniques of topo-algebraic recognition for
languages beyond the regular setting as they relate to logic on words. In
particular, we provide a general construction on recognisers corresponding to
adding one layer of various kinds of quantifiers and prove a corresponding
Reutenauer-type theorem. Our main tools are codensity monads and duality
theory. Our construction hinges on a measure-theoretic characterisation of the
profinite monad of the free S-semimodule monad for finite and commutative
semirings S, which generalises our earlier insight that the Vietoris monad on
Boolean spaces is the codensity monad of the finite powerset functor.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2017 16:22:56 GMT"
},
{
"version": "v2",
"created": "Wed, 29 Aug 2018 12:52:36 GMT"
},
{
"version": "v3",
"created": "Wed, 22 May 2019 18:02:25 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Gehrke",
"Mai",
""
],
[
"Petrisan",
"Daniela",
""
],
[
"Reggio",
"Luca",
""
]
] |
new_dataset
| 0.950476 |
1703.09034
|
Christoph Rauch
|
Bart Jacobs
|
A Recipe for State-and-Effect Triangles
| null |
Logical Methods in Computer Science, Volume 13, Issue 2 (May 17,
2017) lmcs:3223
|
10.23638/LMCS-13(2:6)2017
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the semantics of programming languages one can view programs as state
transformers, or as predicate transformers. Recently the author has introduced
state-and-effect triangles which capture this situation categorically,
involving an adjunction between state- and predicate-transformers. The current
paper exploits a classical result in category theory, part of Jon Beck's
monadicity theorem, to systematically construct such a state-and-effect
triangle from an adjunction. The power of this construction is illustrated in
many examples, covering many monads occurring in program semantics, including
(probabilistic) power domains.
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 12:39:34 GMT"
},
{
"version": "v2",
"created": "Mon, 15 May 2017 15:16:12 GMT"
},
{
"version": "v3",
"created": "Tue, 16 May 2017 09:21:30 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Jacobs",
"Bart",
""
]
] |
new_dataset
| 0.985685 |
1704.03772
|
Luigi Santocanale
|
Maria Jo\~ao Gouveia and Luigi Santocanale
|
$\aleph_1$ and the modal $\mu$-calculus
| null |
Logical Methods in Computer Science, Volume 15, Issue 4 (October
15, 2019) lmcs:4356
|
10.23638/LMCS-15(4:1)2019
| null |
cs.LO math.LO
|
http://creativecommons.org/licenses/by/4.0/
|
For a regular cardinal $\kappa$, a formula of the modal $\mu$-calculus is
$\kappa$-continuous in a variable x if, on every model, its interpretation as a
unary function of x is monotone and preserves unions of $\kappa$-directed sets.
We define the fragment $C_{\aleph_1}(x)$ of the modal $\mu$-calculus and prove
that all the formulas in this fragment are $\aleph_1$-continuous. For each
formula $\phi(x)$ of the modal $\mu$-calculus, we construct a formula $\psi(x)
\in C_{\aleph_1 }(x)$ such that $\phi(x)$ is $\kappa$-continuous, for some
$\kappa$, if and only if $\phi(x)$ is equivalent to $\psi(x)$. Consequently, we
prove that (i) the problem whether a formula is $\kappa$-continuous for some
$\kappa$ is decidable, (ii) up to equivalence, there are only two fragments
determined by continuity at some regular cardinal: the fragment
$C_{\aleph_0}(x)$ studied by Fontaine and the fragment $C_{\aleph_1}(x)$. We
apply our considerations to the problem of characterizing closure ordinals of
formulas of the modal $\mu$-calculus. An ordinal $\alpha$ is the closure
ordinal of a formula $\phi(x)$ if its interpretation on every model converges
to its least fixed-point in at most $\alpha$ steps and if there is a model
where the convergence occurs exactly in $\alpha$ steps. We prove that
$\omega_1$, the least uncountable ordinal, is such a closure ordinal. Moreover
we prove that closure ordinals are closed under ordinal sum. Thus, any formal
expression built from 0, 1, $\omega$, $\omega_1$ by using the binary operator
symbol + gives rise to a closure ordinal.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 14:37:19 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Mar 2018 22:14:54 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Mar 2019 16:38:05 GMT"
},
{
"version": "v4",
"created": "Thu, 3 Oct 2019 11:39:15 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Gouveia",
"Maria João",
""
],
[
"Santocanale",
"Luigi",
""
]
] |
new_dataset
| 0.987815 |
1707.08757
|
EPTCS
|
Philippe Mongin (CNRS and HEC Paris)
|
Bayesian Decision Theory and Stochastic Independence
|
In Proceedings TARK 2017, arXiv:1707.08250
|
Philos. sci. 87 (2020) 152-178
|
10.1086/706083
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stochastic independence has a complex status in probability theory. It is not
part of the definition of a probability measure, but it is nonetheless an
essential property for the mathematical development of this theory. Bayesian
decision theorists such as Savage can be criticized for being silent about
stochastic independence. From their current preference axioms, they can derive
no more than the definitional properties of a probability measure. In a new
framework of twofold uncertainty, we introduce preference axioms that entail
not only these definitional properties, but also the stochastic independence of
the two sources of uncertainty. This goes some way towards filling a curious
lacuna in Bayesian decision theory.
|
[
{
"version": "v1",
"created": "Thu, 27 Jul 2017 07:52:58 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Mongin",
"Philippe",
"",
"CNRS and HEC Paris"
]
] |
new_dataset
| 0.985841 |
1708.04632
|
Didem G\"oz\"upek
|
T{\i}naz Ekim, Didem G\"oz\"upek, Ademir Hujdurovi\'c, Martin
Milani\v{c}
|
On Almost Well-Covered Graphs of Girth at Least 6
| null |
Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
2, Graph Theory (November 20, 2018) dmtcs:4514
|
10.23638/DMTCS-20-2-17
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a relaxation of the concept of well-covered graphs, which are
graphs with all maximal independent sets of the same size. The extent to which
a graph fails to be well-covered can be measured by its independence gap,
defined as the difference between the maximum and minimum sizes of a maximal
independent set in $G$. While the well-covered graphs are exactly the graphs of
independence gap zero, we investigate in this paper graphs of independence gap
one, which we also call almost well-covered graphs. Previous works due to
Finbow et al. (1994) and Barbosa et al. (2013) have implications for the
structure of almost well-covered graphs of girth at least $k$ for $k\in
\{7,8\}$. We focus on almost well-covered graphs of girth at least $6$. We show
that every graph in this class has at most two vertices each of which is
adjacent to exactly $2$ leaves. We give efficiently testable characterizations
of almost well-covered graphs of girth at least $6$ having exactly one or
exactly two such vertices. Building on these results, we develop a
polynomial-time recognition algorithm of almost well-covered
$\{C_3,C_4,C_5,C_7\}$-free graphs.
|
[
{
"version": "v1",
"created": "Tue, 15 Aug 2017 18:12:14 GMT"
},
{
"version": "v2",
"created": "Thu, 17 May 2018 10:19:07 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Oct 2018 18:50:16 GMT"
},
{
"version": "v4",
"created": "Sat, 17 Nov 2018 06:28:51 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Ekim",
"Tınaz",
""
],
[
"Gözüpek",
"Didem",
""
],
[
"Hujdurović",
"Ademir",
""
],
[
"Milanič",
"Martin",
""
]
] |
new_dataset
| 0.970903 |
1708.05486
|
Rodrigo Silveira
|
Rodrigo I. Silveira, Bettina Speckmann and Kevin Verbeek
|
Non-crossing paths with geographic constraints
|
Full version of paper in Proc. 25th International Symposium on Graph
Drawing and Network Visualization (GD 2017), to appear in Discrete
Mathematics & Theoretical Computer Science
|
Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
, Discrete Algorithms (May 23, 2019) dmtcs:4334
|
10.23638/DMTCS-21-3-15
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A geographic network is a graph whose vertices are restricted to lie in a
prescribed region in the plane. In this paper we begin to study the following
fundamental problem for geographic networks: can a given geographic network be
drawn without crossings? We focus on the seemingly simple setting where each
region is a vertical segment, and one wants to connect pairs of segments with a
path that lies inside the convex hull of the two segments. We prove that when
paths must be drawn as straight line segments, it is NP-complete to determine
if a crossing-free solution exists, even if all vertical segments have unit
length. In contrast, we show that when paths must be monotone curves, the
question can be answered in polynomial time. In the more general case of paths
that can have any shape, we show that the problem is polynomial under certain
assumptions.
|
[
{
"version": "v1",
"created": "Fri, 18 Aug 2017 02:32:35 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Feb 2018 09:10:18 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Jan 2019 20:25:28 GMT"
},
{
"version": "v4",
"created": "Tue, 21 May 2019 13:23:18 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Silveira",
"Rodrigo I.",
""
],
[
"Speckmann",
"Bettina",
""
],
[
"Verbeek",
"Kevin",
""
]
] |
new_dataset
| 0.992444 |
1710.07476
|
Alexander Pilz
|
Alexander Pilz
|
Planar 3-SAT with a Clause/Variable Cycle
|
Implementing style of DMTCS journal
|
Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
, Discrete Algorithms (June 5, 2019) dmtcs:4742
|
10.23638/DMTCS-21-3-18
| null |
cs.CC cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the Planar 3-SAT problem, we are given a 3-SAT formula together with its
incidence graph, which is planar, and are asked whether this formula is
satisfiable. Since Lichtenstein's proof that this problem is NP-complete, it
has been used as a starting point for a large number of reductions. In the
course of this research, different restrictions on the incidence graph of the
formula have been devised, for which the problem also remains hard.
In this paper, we investigate the restriction in which we require that the
incidence graph can be augmented by the edges of a Hamiltonian cycle that first
passes through all variables and then through all clauses, in a way that the
resulting graph is still planar. We show that the problem of deciding
satisfiability of a 3-SAT formula remains NP-complete even if the incidence
graph is restricted in that way and the Hamiltonian cycle is given. This
complements previous results demanding cycles only through either the variables
or clauses.
The problem remains hard for monotone formulas, as well as for instances with
exactly three distinct variables per clause. In the course of this
investigation, we show that monotone instances of Planar 3-SAT with exactly
three distinct variables per clause are always satisfiable, thus settling the
question by Darmann, D\"ocker, and Dorn on the complexity of this problem
variant in a surprising way.
|
[
{
"version": "v1",
"created": "Fri, 20 Oct 2017 10:39:42 GMT"
},
{
"version": "v2",
"created": "Mon, 7 May 2018 12:16:52 GMT"
},
{
"version": "v3",
"created": "Wed, 25 Jul 2018 11:07:44 GMT"
},
{
"version": "v4",
"created": "Tue, 22 Jan 2019 19:02:40 GMT"
},
{
"version": "v5",
"created": "Sun, 28 Apr 2019 16:15:25 GMT"
},
{
"version": "v6",
"created": "Mon, 27 May 2019 19:15:18 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Pilz",
"Alexander",
""
]
] |
new_dataset
| 0.999559 |
1710.08748
|
Thorsten Wissmann
|
Diego Figueira, Luc Segoufin
|
Bottom-up automata on data trees and vertical XPath
| null |
Logical Methods in Computer Science, Volume 13, Issue 4 (November
6, 2017) lmcs:4044
|
10.23638/LMCS-13(4:5)2017
| null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A data tree is a finite tree whose every node carries a label from a finite
alphabet and a datum from some infinite domain. We introduce a new model of
automata over unranked data trees with a decidable emptiness problem. It is
essentially a bottom-up alternating automaton with one register that can store
one data value and can be used to perform equality tests with the data values
occurring within the subtree of the current node. We show that it captures the
expressive power of the vertical fragment of XPath - containing the child,
descendant, parent and ancestor axes - obtaining thus a decision procedure for
its satisfiability problem.
|
[
{
"version": "v1",
"created": "Tue, 24 Oct 2017 13:04:12 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Nov 2017 11:41:58 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Figueira",
"Diego",
""
],
[
"Segoufin",
"Luc",
""
]
] |
new_dataset
| 0.996715 |
1710.10706
|
Sebastian Enqvist
|
Sebastian Enqvist and Yde Venema
|
Disjunctive bases: normal forms and model theory for modal logics
|
This is a corrected version of the paper arXiv:1710.10706 published
originally on 26/3, 2019
|
Logical Methods in Computer Science, Volume 15, Issue 1 (August
23, 2022) lmcs:4038
|
10.23638/LMCS-15(1:30)2019
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We present the concept of a disjunctive basis as a generic framework for
normal forms in modal logic based on coalgebra. Disjunctive bases were defined
in previous work on completeness for modal fixpoint logics, where they played a
central role in the proof of a generic completeness theorem for coalgebraic
mu-calculi. Believing the concept has a much wider significance, here we
investigate it more thoroughly in its own right. We show that the presence of a
disjunctive basis at the "one-step" level entails a number of good properties
for a coalgebraic mu-calculus, in particular, a simulation theorem showing that
every alternating automaton can be transformed into an equivalent
nondeterministic one. Based on this, we prove a Lyndon theorem for the full
fixpoint logic, its fixpoint-free fragment and its one-step fragment, and a
Uniform Interpolation result, for both the full mu-calculus and its
fixpoint-free fragment.
We also raise the questions, when a disjunctive basis exists, and how
disjunctive bases are related to Moss' coalgebraic "nabla" modalities. Nabla
formulas provide disjunctive bases for many coalgebraic modal logics, but there
are cases where disjunctive bases give useful normal forms even when nabla
formulas fail to do so, our prime example being graded modal logic. We also
show that disjunctive bases are preserved by forming sums, products and
compositions of coalgebraic modal logics, providing tools for modular
construction of modal logics admitting disjunctive bases. Finally, we consider
the problem of giving a category-theoretic formulation of disjunctive bases,
and provide a partial solution.
|
[
{
"version": "v1",
"created": "Sun, 29 Oct 2017 22:16:41 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jul 2018 22:14:24 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Jan 2019 10:53:16 GMT"
},
{
"version": "v4",
"created": "Mon, 25 Feb 2019 17:06:22 GMT"
},
{
"version": "v5",
"created": "Wed, 6 Mar 2019 14:48:11 GMT"
},
{
"version": "v6",
"created": "Tue, 26 Mar 2019 13:35:31 GMT"
},
{
"version": "v7",
"created": "Fri, 19 Aug 2022 20:53:56 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Enqvist",
"Sebastian",
""
],
[
"Venema",
"Yde",
""
]
] |
new_dataset
| 0.993751 |
1711.03876
|
Ale\v{s} Bizjak
|
Alexander Rabinovich
|
A Proof of Stavi's Theorem
|
arXiv admin note: text overlap with arXiv:1401.2580
|
Logical Methods in Computer Science, Volume 14, Issue 1 (March 6,
2018) lmcs:4061
|
10.23638/LMCS-14(1:20)2018
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Kamp's theorem established the expressive equivalence of the temporal logic
with Until and Since and the First-Order Monadic Logic of Order (FOMLO) over
the Dedekind-complete time flows. However, this temporal logic is not
expressively complete for FOMLO over the rationals. Stavi introduced two
additional modalities and proved that the temporal logic with Until, Since and
Stavi's modalities is expressively equivalent to FOMLO over all linear orders.
We present a simple proof of Stavi's theorem.
|
[
{
"version": "v1",
"created": "Thu, 9 Nov 2017 16:14:46 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Mar 2018 09:09:08 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Rabinovich",
"Alexander",
""
]
] |
new_dataset
| 0.996978 |
1801.00285
|
Thorsten Wissmann
|
Paula Severi
|
A Light Modality for Recursion
|
32 pages 1 figure in pdf format
|
Logical Methods in Computer Science, Volume 15, Issue 1 (February
5, 2019) lmcs:4174
|
10.23638/LMCS-15(1:8)2019
| null |
cs.LO cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
We investigate the interplay between a modality for controlling the behaviour
of recursive functional programs on infinite structures which are completely
silent in the syntax. The latter means that programs do not contain "marks"
showing the application of the introduction and elimination rules for the
modality. This shifts the burden of controlling recursion from the programmer
to the compiler. To do this, we introduce a typed lambda calculus a la Curry
with a silent modality and guarded recursive types. The typing discipline
guarantees normalisation and can be transformed into an algorithm which infers
the type of a program.
|
[
{
"version": "v1",
"created": "Sun, 31 Dec 2017 14:02:33 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Feb 2018 16:16:44 GMT"
},
{
"version": "v3",
"created": "Wed, 2 May 2018 10:41:17 GMT"
},
{
"version": "v4",
"created": "Mon, 23 Jul 2018 19:54:35 GMT"
},
{
"version": "v5",
"created": "Sat, 2 Feb 2019 13:57:14 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Severi",
"Paula",
""
]
] |
new_dataset
| 0.999122 |
1801.01231
|
Amar Hadzihasanovic
|
Giovanni de Felice, Amar Hadzihasanovic, Kang Feng Ng
|
A diagrammatic calculus of fermionic quantum circuits
| null |
Logical Methods in Computer Science, Volume 15, Issue 3 (September
2, 2019) lmcs:5143
|
10.23638/LMCS-15(3:26)2019
| null |
cs.LO quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce the fermionic ZW calculus, a string-diagrammatic language for
fermionic quantum computing (FQC). After defining a fermionic circuit model, we
present the basic components of the calculus, together with their
interpretation, and show how the main physical gates of interest in FQC can be
represented in our language. We then list our axioms, and derive some
additional equations. We prove that the axioms provide a complete equational
axiomatisation of the monoidal category whose objects are systems of finitely
many local fermionic modes (LFMs), with maps that preserve or reverse the
parity of states, and the tensor product as monoidal product. We achieve this
through a procedure that rewrites any diagram in a normal form. As an example,
we show how the statistics of a fermionic Mach-Zehnder interferometer can be
calculated in the diagrammatic language. We conclude by giving a diagrammatic
treatment of the dual-rail encoding, a standard method in optical quantum
computing used to perform universal quantum computation.
|
[
{
"version": "v1",
"created": "Thu, 4 Jan 2018 02:43:52 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Jan 2019 04:48:02 GMT"
},
{
"version": "v3",
"created": "Tue, 25 Jun 2019 02:10:21 GMT"
},
{
"version": "v4",
"created": "Thu, 4 Jul 2019 23:55:05 GMT"
},
{
"version": "v5",
"created": "Fri, 30 Aug 2019 13:44:44 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"de Felice",
"Giovanni",
""
],
[
"Hadzihasanovic",
"Amar",
""
],
[
"Ng",
"Kang Feng",
""
]
] |
new_dataset
| 0.999691 |
1801.08707
|
Victor Marsault
|
Victor Marsault
|
On p/q-recognisable sets
| null |
Logical Methods in Computer Science, Volume 17, Issue 3 (July 28,
2021) lmcs:6834
|
10.46298/lmcs-17(3:12)2021
| null |
cs.LO cs.DM cs.FL
|
http://creativecommons.org/licenses/by/4.0/
|
Let p/q be a rational number. Numeration in base p/q is defined by a function
that evaluates each finite word over A_p={0,1,...,p-1} to some rational number.
We let N_p/q denote the image of this evaluation function. In particular, N_p/q
contains all nonnegative integers and the literature on base p/q usually
focuses on the set of words that are evaluated to nonnegative integers; it is a
rather chaotic language which is not context-free. On the contrary, we study
here the subsets of (N_p/q)^d that are p/q-recognisable, i.e. realised by
finite automata over (A_p)^d. First, we give a characterisation of these sets
as those definable in a first-order logic, similar to the one given by the
B\"uchi-Bruy\`ere Theorem for integer bases numeration systems. Second, we show
that the natural order relation and the modulo-q operator are not
p/q-recognisable.
|
[
{
"version": "v1",
"created": "Fri, 26 Jan 2018 08:21:30 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Sep 2020 08:33:36 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Apr 2021 14:20:21 GMT"
},
{
"version": "v4",
"created": "Tue, 6 Jul 2021 14:18:45 GMT"
},
{
"version": "v5",
"created": "Tue, 27 Jul 2021 13:49:07 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Marsault",
"Victor",
""
]
] |
new_dataset
| 0.997402 |
1802.00061
|
Thorsten Wissmann
|
Max S. New and Daniel R. Licata
|
Call-by-name Gradual Type Theory
| null |
Logical Methods in Computer Science, Volume 16, Issue 1 (January
31, 2020) lmcs:5154
|
10.23638/LMCS-16(1:7)2020
| null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
We present gradual type theory, a logic and type theory for call-by-name
gradual typing. We define the central constructions of gradual typing (the
dynamic type, type casts and type error) in a novel way, by universal
properties relative to new judgments for gradual type and term dynamism, which
were developed in blame calculi and to state the "gradual guarantee" theorem of
gradual typing. Combined with the ordinary extensionality ($\eta$) principles
that type theory provides, we show that most of the standard operational
behavior of casts is uniquely determined by the gradual guarantee. This
provides a semantic justification for the definitions of casts, and shows that
non-standard definitions of casts must violate these principles. Our type
theory is the internal language of a certain class of preorder categories
called equipments. We give a general construction of an equipment interpreting
gradual type theory from a 2-category representing non-gradual types and
programs, which is a semantic analogue of Findler and Felleisen's definitions
of contracts, and use it to build some concrete domain-theoretic models of
gradual typing.
|
[
{
"version": "v1",
"created": "Wed, 31 Jan 2018 20:48:35 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Mar 2018 20:26:53 GMT"
},
{
"version": "v3",
"created": "Thu, 31 Jan 2019 20:46:48 GMT"
},
{
"version": "v4",
"created": "Mon, 5 Aug 2019 18:35:46 GMT"
},
{
"version": "v5",
"created": "Mon, 6 Jan 2020 17:19:47 GMT"
},
{
"version": "v6",
"created": "Wed, 29 Jan 2020 19:50:44 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"New",
"Max S.",
""
],
[
"Licata",
"Daniel R.",
""
]
] |
new_dataset
| 0.997456 |
1802.02191
|
Kuen-Bang Hou (Favonia)
|
Ulrik Buchholtz, Kuen-Bang Hou (Favonia)
|
Cellular Cohomology in Homotopy Type Theory
| null |
Logical Methods in Computer Science, Volume 16, Issue 2 (June 1,
2020) lmcs:5274
|
10.23638/LMCS-16(2:7)2020
| null |
cs.LO math.AT
|
http://creativecommons.org/licenses/by/4.0/
|
We present a development of cellular cohomology in homotopy type theory.
Cohomology associates to each space a sequence of abelian groups capturing part
of its structure, and has the advantage over homotopy groups in that these
abelian groups of many common spaces are easier to compute. Cellular cohomology
is a special kind of cohomology designed for cell complexes: these are built in
stages by attaching spheres of progressively higher dimension, and cellular
cohomology defines the groups out of the combinatorial description of how
spheres are attached. Our main result is that for finite cell complexes, a wide
class of cohomology theories (including the ones defined through
Eilenberg-MacLane spaces) can be calculated via cellular cohomology. This
result was formalized in the Agda proof assistant.
|
[
{
"version": "v1",
"created": "Tue, 6 Feb 2018 20:06:39 GMT"
},
{
"version": "v2",
"created": "Sat, 9 Mar 2019 23:06:15 GMT"
},
{
"version": "v3",
"created": "Tue, 17 Dec 2019 19:20:07 GMT"
},
{
"version": "v4",
"created": "Fri, 29 May 2020 11:24:09 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Buchholtz",
"Ulrik",
"",
"Favonia"
],
[
"Hou",
"Kuen-Bang",
"",
"Favonia"
]
] |
new_dataset
| 0.997883 |
1802.09377
|
Benedikt Pago
|
Erich Gr\"adel and Martin Grohe and Benedikt Pago and Wied Pakusa
|
A Finite-Model-Theoretic View on Propositional Proof Complexity
| null |
Logical Methods in Computer Science, Volume 15, Issue 1 (June 14,
2022) lmcs:4320
|
10.23638/LMCS-15(1:4)2019
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We establish new, and surprisingly tight, connections between propositional
proof complexity and finite model theory. Specifically, we show that the power
of several propositional proof systems, such as Horn resolution, bounded-width
resolution, and the monomial calculus of bounded degree, can be characterised
in a precise sense by variants of fixed-point logics that are of fundamental
importance in descriptive complexity theory. Our main results are that Horn
resolution has the same expressive power as least fixed-point logic, that
bounded-width resolution captures existential least fixed-point logic, and that
the polynomial calculus with bounded degree over the rationals solves precisely
the problems definable in fixed-point logic with counting. We also study the
bounded-degree polynomial calculus. Over the rationals, it captures fixed-point
logic with counting if we restrict the bit-complexity of the coefficients. For
unrestricted coefficients, we can only say that the bounded-degree polynomial
calculus is at most as powerful as bounded variable infinitary counting logic,
but a precise logical characterisation of its power remains an open problem.
These connections between logics and proof systems allow us to establish
finite-model-theoretic tools for proving lower bounds for the polynomial
calculus over the rationals and also over finite fields.
This is a corrected version of the paper (arXiv:1802.09377) published
originally on January 23, 2019.
|
[
{
"version": "v1",
"created": "Mon, 26 Feb 2018 15:07:07 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Aug 2018 13:52:45 GMT"
},
{
"version": "v3",
"created": "Mon, 21 Jan 2019 12:04:50 GMT"
},
{
"version": "v4",
"created": "Thu, 9 Jun 2022 14:06:50 GMT"
},
{
"version": "v5",
"created": "Mon, 13 Jun 2022 11:38:38 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Grädel",
"Erich",
""
],
[
"Grohe",
"Martin",
""
],
[
"Pago",
"Benedikt",
""
],
[
"Pakusa",
"Wied",
""
]
] |
new_dataset
| 0.996721 |
1803.09639
|
Laurent Beaudou
|
Laurent Beaudou and Richard C. Brewster
|
On the multipacking number of grid graphs
| null |
Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
, Graph Theory (June 20, 2019) dmtcs:4452
|
10.23638/DMTCS-21-3-23
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 2001, Erwin introduced broadcast domination in graphs. It is a variant of
classical domination where selected vertices may have different domination
powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted
$\gamma_b(G)$. The dual of this problem is called multipacking: a multipacking
is a set $M$ of vertices such that for any vertex $v$ and any positive integer
$r$, the ball of radius $r$ around $v$ contains at most $r$ vertices of $M$ .
The maximum size of a multipacking in a graph $G$ is denoted mp(G). Naturally
mp(G) $\leq \gamma_b(G)$. Earlier results by Farber and by Lubiw show that
broadcast and multipacking numbers are equal for strongly chordal graphs. In
this paper, we show that all large grids (height at least 4 and width at least
7), which are far from being chordal, have their broadcast and multipacking
numbers equal.
|
[
{
"version": "v1",
"created": "Mon, 26 Mar 2018 14:59:29 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Feb 2019 19:39:30 GMT"
},
{
"version": "v3",
"created": "Thu, 28 Feb 2019 07:34:52 GMT"
},
{
"version": "v4",
"created": "Tue, 5 Mar 2019 07:56:09 GMT"
},
{
"version": "v5",
"created": "Mon, 17 Jun 2019 08:05:17 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Beaudou",
"Laurent",
""
],
[
"Brewster",
"Richard C.",
""
]
] |
new_dataset
| 0.9795 |
1805.03740
|
Benedikt Ahrens
|
Benedikt Ahrens, Andr\'e Hirschowitz, Ambroise Lafont, Marco Maggesi
|
Presentable signatures and initial semantics
| null |
Logical Methods in Computer Science, Volume 17, Issue 2 (May 26,
2021) lmcs:5136
|
10.23638/LMCS-17(2:17)2021
| null |
cs.LO cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
We present a device for specifying and reasoning about syntax for datatypes,
programming languages, and logic calculi. More precisely, we study a notion of
"signature" for specifying syntactic constructions.
In the spirit of Initial Semantics, we define the "syntax generated by a
signature" to be the initial object -- if it exists -- in a suitable category
of models. In our framework, the existence of an associated syntax to a
signature is not automatically guaranteed. We identify, via the notion of
presentation of a signature, a large class of signatures that do generate a
syntax.
Our (presentable) signatures subsume classical algebraic signatures (i.e.,
signatures for languages with variable binding, such as the pure lambda
calculus) and extend them to include several other significant examples of
syntactic constructions.
One key feature of our notions of signature, syntax, and presentation is that
they are highly compositional, in the sense that complex examples can be
obtained by gluing simpler ones. Moreover, through the Initial Semantics
approach, our framework provides, beyond the desired algebra of terms, a
well-behaved substitution and the induction and recursion principles associated
to the syntax.
This paper builds upon ideas from a previous attempt by Hirschowitz-Maggesi,
which, in turn, was directly inspired by some earlier work of
Ghani-Uustalu-Hamana and Matthes-Uustalu.
The main results presented in the paper are computer-checked within the
UniMath system.
|
[
{
"version": "v1",
"created": "Wed, 9 May 2018 21:32:06 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Jan 2019 14:48:29 GMT"
},
{
"version": "v3",
"created": "Thu, 26 Mar 2020 16:07:36 GMT"
},
{
"version": "v4",
"created": "Sun, 2 May 2021 13:48:54 GMT"
},
{
"version": "v5",
"created": "Tue, 25 May 2021 11:17:37 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Ahrens",
"Benedikt",
""
],
[
"Hirschowitz",
"André",
""
],
[
"Lafont",
"Ambroise",
""
],
[
"Maggesi",
"Marco",
""
]
] |
new_dataset
| 0.996671 |
1805.11988
|
Ale\v{s} Bizjak
|
Cl\'ement Aubert and Marc Bagnol
|
Unification and Logarithmic Space
|
arXiv admin note: text overlap with arXiv:1402.4327
|
Logical Methods in Computer Science, Volume 14, Issue 3 (July 31,
2018) lmcs:4552
|
10.23638/LMCS-14(3:6)2018
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We present an algebraic characterization of the complexity classes Logspace
and Nlogspace, using an algebra with a composition law based on unification.
This new bridge between unification and complexity classes is rooted in proof
theory and more specifically linear logic and geometry of interaction. We show
how to build a model of computation in the unification algebra and then, by
means of a syntactic representation of finite permutations in the algebra, we
prove that whether an observation (the algebraic counterpart of a program)
accepts a word can be decided within logarithmic space. Finally, we show that
the construction naturally corresponds to pointer machines, a convenient way of
understanding logarithmic space computation.
|
[
{
"version": "v1",
"created": "Tue, 29 May 2018 15:10:53 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Jul 2018 09:58:50 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Aubert",
"Clément",
""
],
[
"Bagnol",
"Marc",
""
]
] |
new_dataset
| 0.995013 |
1807.00663
|
Pascal Caron
|
Pascal Caron, Edwin Hamel-De le court, Jean-Gabriel Luque, Bruno
Patrou
|
New tools for state complexity
|
18 pages
|
Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
1, Automata, Logic and Semantics (March 16, 2020) dmtcs:4835
|
10.23638/DMTCS-22-1-9
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A monster is an automaton in which every function from states to states is
represented by at least one letter. A modifier is a set of functions allowing
one to transform a set of automata into one automaton. We revisit some language
transformation algorithms in terms of modifier and monster. These new
theoretical concepts allow one to find easily some state complexities. We
illustrate this by retrieving the state complexity of the Star of Intersection
and the one of the Square root operation.
|
[
{
"version": "v1",
"created": "Mon, 2 Jul 2018 13:54:36 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Sep 2018 13:30:15 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Sep 2019 08:25:20 GMT"
},
{
"version": "v4",
"created": "Mon, 6 Jan 2020 15:23:42 GMT"
},
{
"version": "v5",
"created": "Mon, 20 Jan 2020 09:13:44 GMT"
},
{
"version": "v6",
"created": "Mon, 2 Mar 2020 09:47:17 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Caron",
"Pascal",
""
],
[
"court",
"Edwin Hamel-De le",
""
],
[
"Luque",
"Jean-Gabriel",
""
],
[
"Patrou",
"Bruno",
""
]
] |
new_dataset
| 0.975217 |
1807.00893
|
Blaise Genest
|
Nathalie Bertrand and Miheer Dewaskar and Blaise Genest and Hugo
Gimbert and Adwait Amit Godbole
|
Controlling a population
|
This is a journal version of the extended abstract arXiv:1707.02058
which appeared in Concur 2017, together with proofs
|
Logical Methods in Computer Science, Volume 15, Issue 3 (July 29,
2019) lmcs:4662
|
10.23638/LMCS-15(3:6)2019
| null |
cs.FL cs.SY eess.SY
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce a new setting where a population of agents, each modelled by a
finite-state system, are controlled uniformly: the controller applies the same
action to every agent. The framework is largely inspired by the control of a
biological system, namely a population of yeasts, where the controller may only
change the environment common to all cells. We study a synchronisation problem
for such populations: no matter how individual agents react to the actions of
the controller, the controller aims at driving all agents synchronously to a
target state. The agents are naturally represented by a non-deterministic
finite state automaton (NFA), the same for every agent, and the whole system is
encoded as a 2-player game. The first player (Controller) chooses actions, and
the second player (Agents) resolves non-determinism for each agent. The game
with m agents is called the m -population game. This gives rise to a
parameterized control problem (where control refers to 2 player games), namely
the population control problem: can Controller control the m-population game
for all m in N whatever Agents does?
|
[
{
"version": "v1",
"created": "Mon, 2 Jul 2018 21:15:17 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Mar 2019 16:59:29 GMT"
},
{
"version": "v3",
"created": "Fri, 26 Jul 2019 13:40:58 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Bertrand",
"Nathalie",
""
],
[
"Dewaskar",
"Miheer",
""
],
[
"Genest",
"Blaise",
""
],
[
"Gimbert",
"Hugo",
""
],
[
"Godbole",
"Adwait Amit",
""
]
] |
new_dataset
| 0.967879 |
1808.08710
|
Laurent Beaudou
|
Laurent Beaudou, Giacomo Kahn and Matthieu Rosenfeld
|
Bisplit graphs satisfy the Chen-Chv\'atal conjecture
| null |
Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
1, ICGT 2018 (May 29, 2019) dmtcs:4813
|
10.23638/DMTCS-21-1-5
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we give a lengthy proof of a small result! A graph is bisplit
if its vertex set can be partitioned into three stable sets with two of them
inducing a complete bipartite graph. We prove that these graphs satisfy the
Chen-Chv\'atal conjecture: their metric space (in the usual sense) has a
universal line (in an unusual sense) or at least as many lines as the number of
vertices.
|
[
{
"version": "v1",
"created": "Mon, 27 Aug 2018 07:19:53 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Aug 2018 07:31:17 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Mar 2019 08:13:12 GMT"
},
{
"version": "v4",
"created": "Thu, 23 May 2019 13:13:31 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Beaudou",
"Laurent",
""
],
[
"Kahn",
"Giacomo",
""
],
[
"Rosenfeld",
"Matthieu",
""
]
] |
new_dataset
| 0.999329 |
1809.09033
|
Olivier Carton
|
Olivier Carton and Luc Boasson
|
Transfinite Lyndon words
| null |
Logical Methods in Computer Science, Volume 16, Issue 4 (November
10, 2020) lmcs:4851
|
10.23638/LMCS-16(4:9)2020
| null |
cs.FL
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we extend the notion of Lyndon word to transfinite words. We
prove two main results. We first show that, given a transfinite word, there
exists a unique factorization in Lyndon words that are densely non-increasing,
a relaxation of the condition used in the case of finite words.
In the annex, we prove that the factorization of a rational word has a
special form and that it can be computed from a rational expression describing
the word.
|
[
{
"version": "v1",
"created": "Mon, 24 Sep 2018 16:20:26 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Feb 2020 18:16:05 GMT"
},
{
"version": "v3",
"created": "Tue, 25 Aug 2020 09:05:29 GMT"
},
{
"version": "v4",
"created": "Wed, 26 Aug 2020 13:08:53 GMT"
},
{
"version": "v5",
"created": "Fri, 28 Aug 2020 06:55:43 GMT"
},
{
"version": "v6",
"created": "Mon, 9 Nov 2020 14:47:58 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Carton",
"Olivier",
""
],
[
"Boasson",
"Luc",
""
]
] |
new_dataset
| 0.999564 |
1810.12896
|
Alexandre Talon
|
Micha\"el Rao and Alexandre Talon
|
The 2-domination and Roman domination numbers of grid graphs
|
11 pages, 5 figures, presented at ICGT 2018 The program that led to
the results is included in the Source directory (see Other formats) Accepted
in DMTCS vol 21. Journal version with their template
|
Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
1, ICGT 2018 (May 23, 2019) dmtcs:4952
|
10.23638/DMTCS-21-1-9
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the 2-domination number for grid graphs, that is the size of a
smallest set $D$ of vertices of the grid such that each vertex of the grid
belongs to $D$ or has at least two neighbours in $D$. We give a closed formula
giving the 2-domination number of any $n \!\times\! m$ grid, hereby confirming
the results found by Lu and Xu, and Shaheen et al. for $n \leq 4$ and slightly
correct the value of Shaheen et al. for $n = 5$. The proof relies on some
dynamic programming algorithms, using transfer matrices in (min,+)-algebra. We
also apply the method to solve the Roman domination problem on grid graphs.
|
[
{
"version": "v1",
"created": "Tue, 30 Oct 2018 17:47:09 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Nov 2018 17:40:24 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Apr 2019 15:40:28 GMT"
},
{
"version": "v4",
"created": "Fri, 17 May 2019 14:15:52 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Rao",
"Michaël",
""
],
[
"Talon",
"Alexandre",
""
]
] |
new_dataset
| 0.993569 |
1901.03366
|
Philipp Hieronymi
|
Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan, Ruoyu Meng, Erik
Walsberg, Zihe Wang, Ziqin Xiong, Hongru Yang
|
Continuous Regular Functions
| null |
Logical Methods in Computer Science, Volume 16, Issue 1 (February
14, 2020) lmcs:5301
|
10.23638/LMCS-16(1:17)2020
| null |
cs.LO math.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function
$f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that
accepts precisely the set of base $r \in \mathbb{N}$ representations of
elements of the graph of $f$. We show that a continuous $r$-regular function
$f$ is locally affine away from a nowhere dense, Lebesgue null, subset of
$[0,1]$. As a corollary we establish that every differentiable $r$-regular
function is affine. It follows that checking whether an $r$-regular function is
differentiable is in $\operatorname{PSPACE}$. Our proofs rely crucially on
connections between automata theory and metric geometry developed by Charlier,
Leroy, and Rigo.
|
[
{
"version": "v1",
"created": "Thu, 10 Jan 2019 20:08:05 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Sep 2019 21:41:08 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Feb 2020 10:12:11 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Gorman",
"Alexi Block",
""
],
[
"Hieronymi",
"Philipp",
""
],
[
"Kaplan",
"Elliot",
""
],
[
"Meng",
"Ruoyu",
""
],
[
"Walsberg",
"Erik",
""
],
[
"Wang",
"Zihe",
""
],
[
"Xiong",
"Ziqin",
""
],
[
"Yang",
"Hongru",
""
]
] |
new_dataset
| 0.990357 |
1901.03571
|
Mickael Randour
|
Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, and Mickael
Randour
|
Life is Random, Time is Not: Markov Decision Processes with Window
Objectives
| null |
Logical Methods in Computer Science, Volume 16, Issue 4 (December
14, 2020) lmcs:5968
|
10.23638/LMCS-16(4:13)2020
| null |
cs.LO cs.AI cs.FL cs.GT math.PR
|
http://creativecommons.org/licenses/by/4.0/
|
The window mechanism was introduced by Chatterjee et al. to strengthen
classical game objectives with time bounds. It permits to synthesize system
controllers that exhibit acceptable behaviors within a configurable time frame,
all along their infinite execution, in contrast to the traditional objectives
that only require correctness of behaviors in the limit. The window concept has
proved its interest in a variety of two-player zero-sum games because it
enables reasoning about such time bounds in system specifications, but also
thanks to the increased tractability that it usually yields.
In this work, we extend the window framework to stochastic environments by
considering Markov decision processes. A fundamental problem in this context is
the threshold probability problem: given an objective it aims to synthesize
strategies that guarantee satisfying runs with a given probability. We solve it
for the usual variants of window objectives, where either the time frame is set
as a parameter, or we ask if such a time frame exists. We develop a generic
approach for window-based objectives and instantiate it for the classical
mean-payoff and parity objectives, already considered in games. Our work paves
the way to a wide use of the window mechanism in stochastic models.
|
[
{
"version": "v1",
"created": "Fri, 11 Jan 2019 12:20:34 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Jul 2019 16:52:04 GMT"
},
{
"version": "v3",
"created": "Wed, 11 Dec 2019 09:11:52 GMT"
},
{
"version": "v4",
"created": "Thu, 2 Apr 2020 13:53:51 GMT"
},
{
"version": "v5",
"created": "Thu, 10 Dec 2020 19:59:49 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Brihaye",
"Thomas",
""
],
[
"Delgrange",
"Florent",
""
],
[
"Oualhadj",
"Youssouf",
""
],
[
"Randour",
"Mickael",
""
]
] |
new_dataset
| 0.999481 |
1901.06547
|
Mat\v{e}j Dost\'al
|
Marta B\'ilkov\'a, Mat\v{e}j Dost\'al
|
Moss' logic for ordered coalgebras
| null |
Logical Methods in Computer Science, Volume 18, Issue 3 (August 9,
2022) lmcs:5158
|
10.46298/lmcs-18(3:18)2022
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras,
where $T$ is a locally monotone endofunctor of the category of posets and
monotone maps. The logic uses a single cover modality whose arity is given by
the least finitary subfunctor of the dual of the coalgebra functor
$T_\omega^\partial$, and the semantics of the modality is given by relation
lifting. For the semantics to work, $T$ is required to preserve exact squares.
For the finitary setting to work, $T_\omega^\partial$ is required to preserve
finite intersections. We develop a notion of a base for subobjects of $T_\omega
X$. This in particular allows us to talk about the finite poset of subformulas
for a given formula. The notion of a base is introduced generally for a
category equipped with a suitable factorisation system.
We prove that the resulting logic has the Hennessy-Milner property for the
notion of similarity based on the notion of relation lifting. We define a
sequent proof system for the logic, and prove its completeness.
|
[
{
"version": "v1",
"created": "Sat, 19 Jan 2019 16:14:25 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Dec 2020 16:24:01 GMT"
},
{
"version": "v3",
"created": "Mon, 14 Jun 2021 16:09:52 GMT"
},
{
"version": "v4",
"created": "Mon, 25 Jul 2022 12:06:16 GMT"
},
{
"version": "v5",
"created": "Sat, 6 Aug 2022 12:49:05 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Bílková",
"Marta",
""
],
[
"Dostál",
"Matěj",
""
]
] |
new_dataset
| 0.990198 |
1902.08345
|
Thorsten Wissmann
|
Mauricio Ayala-Rinc\'on, Maribel Fern\'andez and Daniele
Nantes-Sobrinho
|
On Nominal Syntax and Permutation Fixed Points
| null |
Logical Methods in Computer Science, Volume 16, Issue 1 (February
17, 2020) lmcs:5209
|
10.23638/LMCS-16(1:19)2020
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We propose a new axiomatisation of the alpha-equivalence relation for nominal
terms, based on a primitive notion of fixed-point constraint. We show that the
standard freshness relation between atoms and terms can be derived from the
more primitive notion of permutation fixed-point, and use this result to prove
the correctness of the new $\alpha$-equivalence axiomatisation. This gives rise
to a new notion of nominal unification, where solutions for unification
problems are pairs of a fixed-point context and a substitution. Although it may
seem less natural than the standard notion of nominal unifier based on
freshness constraints, the notion of unifier based on fixed-point constraints
behaves better when equational theories are considered: for example, nominal
unification remains finitary in the presence of commutativity, whereas it
becomes infinitary when unifiers are expressed using freshness contexts. We
provide a definition of $\alpha$-equivalence modulo equational theories that
take into account A, C and AC theories. Based on this notion of equivalence, we
show that C-unification is finitary and we provide a sound and complete
C-unification algorithm, as a first step towards the development of nominal
unification modulo AC and other equational theories with permutative
properties.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2019 02:48:02 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Jul 2019 02:32:47 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Dec 2019 14:38:23 GMT"
},
{
"version": "v4",
"created": "Fri, 14 Feb 2020 08:25:52 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Ayala-Rincón",
"Mauricio",
""
],
[
"Fernández",
"Maribel",
""
],
[
"Nantes-Sobrinho",
"Daniele",
""
]
] |
new_dataset
| 0.987197 |
1902.10654
|
Thorsten Wissmann
|
Karoliina Lehtinen and Udi Boker
|
Register Games
| null |
Logical Methods in Computer Science, Volume 16, Issue 2 (May 19,
2020) lmcs:5217
|
10.23638/LMCS-16(2:6)2020
| null |
cs.FL
|
http://creativecommons.org/licenses/by/4.0/
|
The complexity of parity games is a long standing open problem that saw a
major breakthrough in 2017 when two quasi-polynomial algorithms were published.
This article presents a third, independent approach to solving parity games in
quasi-polynomial time, based on the notion of register game, a parameterised
variant of a parity game. The analysis of register games leads to a
quasi-polynomial algorithm for parity games, a polynomial algorithm for
restricted classes of parity games and a novel measure of complexity, the
register index, which aims to capture the combined complexity of the priority
assignement and the underlying game graph.
We further present a translation of alternating parity word automata into
alternating weak automata with only a quasi-polynomial increase in size, based
on register games; this improves on the previous exponential translation.
We also use register games to investigate the parity index hierarchy: while
for words the index hierarchy of alternating parity automata collapses to the
weak level, and for trees it is strict, for structures between trees and words,
it collapses logarithmically, in the sense that any parity tree automaton of
size n is equivalent, on these particular classes of structures, to an
automaton with a number of priorities logarithmic in n.
|
[
{
"version": "v1",
"created": "Wed, 27 Feb 2019 17:39:31 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Feb 2019 10:08:52 GMT"
},
{
"version": "v3",
"created": "Fri, 1 Mar 2019 09:14:55 GMT"
},
{
"version": "v4",
"created": "Thu, 3 Oct 2019 14:54:20 GMT"
},
{
"version": "v5",
"created": "Wed, 8 Apr 2020 15:45:36 GMT"
},
{
"version": "v6",
"created": "Thu, 23 Apr 2020 13:44:55 GMT"
},
{
"version": "v7",
"created": "Mon, 18 May 2020 13:22:34 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Lehtinen",
"Karoliina",
""
],
[
"Boker",
"Udi",
""
]
] |
new_dataset
| 0.95459 |
1903.09905
|
Tim Smith
|
Tim Smith
|
A Characterization of Morphic Words with Polynomial Growth
| null |
Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
1, Automata, Logic and Semantics (February 6, 2020) dmtcs:5324
|
10.23638/DMTCS-22-1-3
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A morphic word is obtained by iterating a morphism to generate an infinite
word, and then applying a coding. We characterize morphic words with polynomial
growth in terms of a new type of infinite word called a $\textit{zigzag word}$.
A zigzag word is represented by an initial string, followed by a finite list of
terms, each of which repeats for each $n \geq 1$ in one of three ways: it grows
forward [$t(1)\ t(2)\ \dotsm\ t(n)]$, backward [$t(n)\ \dotsm\ t(2)\ t(1)$], or
just occurs once [$t$]. Each term can recursively contain subterms with their
own forward and backward repetitions. We show that an infinite word is morphic
with growth $\Theta(n^k)$ iff it is a zigzag word of depth $k$. As corollaries,
we obtain that the morphic words with growth $O(n)$ are exactly the ultimately
periodic words, and the morphic words with growth $O(n^2)$ are exactly the
multilinear words.
|
[
{
"version": "v1",
"created": "Sun, 24 Mar 2019 00:24:05 GMT"
},
{
"version": "v2",
"created": "Thu, 31 Oct 2019 15:36:58 GMT"
},
{
"version": "v3",
"created": "Sat, 1 Feb 2020 19:31:13 GMT"
},
{
"version": "v4",
"created": "Tue, 4 Feb 2020 18:00:42 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Smith",
"Tim",
""
]
] |
new_dataset
| 0.958817 |
1904.01381
|
Abuzer Yakaryilmaz
|
Aleksejs Naumovs, Maksims Dimitrijevs, and Abuzer Yakary{\i}lmaz
|
The minimal probabilistic and quantum finite automata recognizing
uncountably many languages with fixed cutpoints
|
12 pages, minor revisions, changing the format to "dmtcs-episciences"
style
|
Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
1, Automata, Logic and Semantics (April 30, 2020) dmtcs:5450
|
10.23638/DMTCS-22-1-13
| null |
cs.FL cs.CC quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
It is known that 2-state binary and 3-state unary probabilistic finite
automata and 2-state unary quantum finite automata recognize uncountably many
languages with cutpoints. These results have been obtained by associating each
recognized language with a cutpoint and then by using the fact that there are
uncountably many cutpoints. In this note, we prove the same results for fixed
cutpoints: each recognized language is associated with an automaton (i.e.,
algorithm), and the proofs use the fact that there are uncountably many
automata. For each case, we present a new construction.
|
[
{
"version": "v1",
"created": "Tue, 2 Apr 2019 12:52:20 GMT"
},
{
"version": "v2",
"created": "Fri, 10 May 2019 10:52:53 GMT"
},
{
"version": "v3",
"created": "Thu, 2 Apr 2020 16:22:43 GMT"
},
{
"version": "v4",
"created": "Tue, 28 Apr 2020 12:36:57 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Naumovs",
"Aleksejs",
""
],
[
"Dimitrijevs",
"Maksims",
""
],
[
"Yakaryılmaz",
"Abuzer",
""
]
] |
new_dataset
| 0.999196 |
1904.02564
|
Antoine Amarilli
|
Joachim Parrow, Johannes Borgstr\"om, Lars-Henrik Eriksson, Ram\=unas
Forsberg Gutkovas, Tjark Weber
|
Modal Logics for Nominal Transition Systems
| null |
Logical Methods in Computer Science, Volume 17, Issue 1 (January
28, 2021) lmcs:5353
|
10.23638/LMCS-17(1:6)2021
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We define a general notion of transition system where states and action
labels can be from arbitrary nominal sets, actions may bind names, and state
predicates from an arbitrary logic define properties of states. A
Hennessy-Milner logic for these systems is introduced, and proved adequate and
expressively complete for bisimulation equivalence. A main technical novelty is
the use of finitely supported infinite conjunctions. We show how to treat
different bisimulation variants such as early, late, open and weak in a
systematic way, explore the folklore theorem that state predicates can be
replaced by actions, and make substantial comparisons with related work. The
main definitions and theorems have been formalised in Nominal Isabelle.
|
[
{
"version": "v1",
"created": "Thu, 4 Apr 2019 14:11:42 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Mar 2020 15:33:10 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Jan 2021 09:44:32 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Parrow",
"Joachim",
""
],
[
"Borgström",
"Johannes",
""
],
[
"Eriksson",
"Lars-Henrik",
""
],
[
"Gutkovas",
"Ramūnas Forsberg",
""
],
[
"Weber",
"Tjark",
""
]
] |
new_dataset
| 0.993728 |
1905.00559
|
Heiko Vogler
|
Joost Engelfriet and Heiko Vogler
|
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
| null |
Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
4, Automata, Logic and Semantics (August 27, 2020) dmtcs:5424
|
10.23638/DMTCS-22-4-3
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce MSO graph storage types, and call a storage type MSO-expressible
if it is isomorphic to some MSO graph storage type. An MSO graph storage type
has MSO-definable sets of graphs as storage configurations and as storage
transformations. We consider sequential automata with MSO graph storage and
associate with each such automaton a string language (in the usual way) and a
graph language; a graph is accepted by the automaton if it represents a correct
sequence of storage configurations for a given input string. For each MSO graph
storage type, we define an MSO logic which is a subset of the usual MSO logic
on graphs. We prove a B\"uchi-Elgot-Trakhtenbrot theorem, both for the string
case and the graph case. Moreover, we prove that (i) each MSO graph
transduction can be used as storage transformation in an MSO graph storage
type, (ii) every automatic storage type is MSO-expressible, and (iii) the
pushdown operator on storage types preserves the property of
MSO-expressibility. Thus, the iterated pushdown storage types are
MSO-expressible.
|
[
{
"version": "v1",
"created": "Thu, 2 May 2019 03:03:44 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Nov 2019 14:51:48 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Jul 2020 12:11:53 GMT"
},
{
"version": "v4",
"created": "Thu, 20 Aug 2020 16:04:42 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Engelfriet",
"Joost",
""
],
[
"Vogler",
"Heiko",
""
]
] |
new_dataset
| 0.984993 |
1905.03588
|
Antoine Amarilli
|
Milad Aghajohari and Guy Avni and Thomas A. Henzinger
|
Determinacy in Discrete-Bidding Infinite-Duration Games
| null |
Logical Methods in Computer Science, Volume 17, Issue 1 (February
3, 2021) lmcs:5977
|
10.23638/LMCS-17(1:10)2021
| null |
cs.GT cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a
non-terminating system and its environment. In bidding games the players bid
for the right to move the token: in each round, the players simultaneously
submit bids, and the higher bidder moves the token and pays the other player.
Bidding games are known to have a clean and elegant mathematical structure that
relies on the ability of the players to submit arbitrarily small bids. Many
applications, however, require a fixed granularity for the bids, which can
represent, for example, the monetary value expressed in cents. We study, for
the first time, the combination of discrete-bidding and infinite-duration
games. Our most important result proves that these games form a large
determined subclass of concurrent games, where determinacy is the strong
property that there always exists exactly one player who can guarantee winning
the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets.
|
[
{
"version": "v1",
"created": "Thu, 9 May 2019 13:08:10 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Jul 2019 08:17:05 GMT"
},
{
"version": "v3",
"created": "Mon, 16 Dec 2019 13:56:15 GMT"
},
{
"version": "v4",
"created": "Thu, 17 Sep 2020 07:23:25 GMT"
},
{
"version": "v5",
"created": "Fri, 25 Dec 2020 08:32:17 GMT"
},
{
"version": "v6",
"created": "Mon, 1 Feb 2021 19:37:17 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Aghajohari",
"Milad",
""
],
[
"Avni",
"Guy",
""
],
[
"Henzinger",
"Thomas A.",
""
]
] |
new_dataset
| 0.999235 |
1906.04199
|
Vrunda Dave
|
V. Dave, E. Filiot, S. Krishna and N. Lhote
|
Synthesis of Computable Regular Functions of Infinite Words
| null |
Logical Methods in Computer Science, Volume 18, Issue 2 (June 29,
2022) lmcs:7592
|
10.46298/lmcs-18(2:23)2022
| null |
cs.FL cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Regular functions from infinite words to infinite words can be equivalently
specified by MSO-transducers, streaming $\omega$-string transducers as well as
deterministic two-way transducers with look-ahead. In their one-way
restriction, the latter transducers define the class of rational functions.
Even though regular functions are robustly characterised by several
finite-state devices, even the subclass of rational functions may contain
functions which are not computable (by a Turing machine with infinite input).
This paper proposes a decision procedure for the following synthesis problem:
given a regular function $f$ (equivalently specified by one of the
aforementioned transducer model), is $f$ computable and if it is, synthesize a
Turing machine computing it.
For regular functions, we show that computability is equivalent to
continuity, and therefore the problem boils down to deciding continuity. We
establish a generic characterisation of continuity for functions preserving
regular languages under inverse image (such as regular functions). We exploit
this characterisation to show the decidability of continuity (and hence
computability) of rational and regular functions. For rational functions, we
show that this can be done in $\mathsf{NLogSpace}$ (it was already known to be
in $\mathsf{PTime}$ by Prieur). In a similar fashion, we also effectively
characterise uniform continuity of regular functions, and relate it to the
notion of uniform computability, which offers stronger efficiency guarantees.
|
[
{
"version": "v1",
"created": "Wed, 15 May 2019 11:35:35 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Jun 2021 14:37:13 GMT"
},
{
"version": "v3",
"created": "Wed, 16 Feb 2022 12:04:14 GMT"
},
{
"version": "v4",
"created": "Mon, 25 Apr 2022 17:13:29 GMT"
},
{
"version": "v5",
"created": "Tue, 28 Jun 2022 11:41:33 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Dave",
"V.",
""
],
[
"Filiot",
"E.",
""
],
[
"Krishna",
"S.",
""
],
[
"Lhote",
"N.",
""
]
] |
new_dataset
| 0.985146 |
1906.09503
|
Vladimir Zamdzhiev
|
Bert Lindenhovius and Michael Mislove and Vladimir Zamdzhiev
|
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
| null |
Logical Methods in Computer Science, Volume 17, Issue 2 (April 22,
2021) lmcs:5703
|
10.23638/LMCS-17(2:9)2021
| null |
cs.PL cs.LO math.CT
|
http://creativecommons.org/licenses/by/4.0/
|
We describe a type system with mixed linear and non-linear recursive types
called LNL-FPC (the linear/non-linear fixpoint calculus). The type system
supports linear typing, which enhances the safety properties of programs, but
also supports non-linear typing as well, which makes the type system more
convenient for programming. Just as in FPC, we show that LNL-FPC supports
type-level recursion, which in turn induces term-level recursion. We also
provide sound and computationally adequate categorical models for LNL-FPC that
describe the categorical structure of the substructural operations of
Intuitionistic Linear Logic at all non-linear types, including the recursive
ones. In order to do so, we describe a new technique for solving recursive
domain equations within cartesian categories by constructing the solutions over
pre-embeddings. The type system also enjoys implicit weakening and contraction
rules that we are able to model by identifying the canonical comonoid structure
of all non-linear types. We also show that the requirements of our abstract
model are reasonable by constructing a large class of concrete models that have
found applications not only in classical functional programming, but also in
emerging programming paradigms that incorporate linear types, such as quantum
programming and circuit description programming languages.
|
[
{
"version": "v1",
"created": "Sat, 22 Jun 2019 20:50:27 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Aug 2019 14:30:24 GMT"
},
{
"version": "v3",
"created": "Mon, 25 May 2020 23:21:45 GMT"
},
{
"version": "v4",
"created": "Wed, 17 Mar 2021 20:37:57 GMT"
},
{
"version": "v5",
"created": "Tue, 23 Mar 2021 15:07:34 GMT"
},
{
"version": "v6",
"created": "Wed, 21 Apr 2021 06:44:05 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Lindenhovius",
"Bert",
""
],
[
"Mislove",
"Michael",
""
],
[
"Zamdzhiev",
"Vladimir",
""
]
] |
new_dataset
| 0.989229 |
1907.13115
|
Tom\'a\v{s} Masopust
|
Tom\'a\v{s} Masopust and Markus Kr\"otzsch
|
Partially Ordered Automata and Piecewise Testability
|
arXiv admin note: text overlap with arXiv:1704.07860
|
Logical Methods in Computer Science, Volume 17, Issue 2 (May 11,
2021) lmcs:5900
|
10.23638/LMCS-17(2:14)2021
| null |
cs.LO cs.FL
|
http://creativecommons.org/licenses/by/4.0/
|
Partially ordered automata are automata where the transition relation induces
a partial order on states. The expressive power of partially ordered automata
is closely related to the expressivity of fragments of first-order logic on
finite words or, equivalently, to the language classes of the levels of the
Straubing-Th\'erien hierarchy. Several fragments (levels) have been intensively
investigated under various names. For instance, the fragment of first-order
formulae with a single existential block of quantifiers in prenex normal form
is known as piecewise testable languages or $J$-trivial languages. These
languages are characterized by confluent partially ordered DFAs or by complete,
confluent, and self-loop-deterministic partially ordered NFAs (ptNFAs for
short). In this paper, we study the complexity of basic questions for several
types of partially ordered automata on finite words; namely, the questions of
inclusion, equivalence, and ($k$-)piecewise testability. The lower-bound
complexity boils down to the complexity of universality. The universality
problem asks whether a system recognizes all words over its alphabet. For
ptNFAs, the complexity of universality decreases if the alphabet is fixed, but
it is open if the alphabet may grow with the number of states. We show that
deciding universality for general ptNFAs is as hard as for general NFAs. Our
proof is a novel and nontrivial extension of our recent construction for
self-loop-deterministic partially ordered NFAs, a model strictly more
expressive than ptNFAs. We provide a comprehensive picture of the complexities
of the problems of inclusion, equivalence, and ($k$-)piecewise testability for
the considered types of automata.
|
[
{
"version": "v1",
"created": "Mon, 29 Jul 2019 10:50:26 GMT"
},
{
"version": "v2",
"created": "Sun, 29 Sep 2019 18:03:19 GMT"
},
{
"version": "v3",
"created": "Fri, 8 Nov 2019 16:33:55 GMT"
},
{
"version": "v4",
"created": "Sun, 5 Jul 2020 20:42:56 GMT"
},
{
"version": "v5",
"created": "Fri, 16 Apr 2021 20:04:03 GMT"
},
{
"version": "v6",
"created": "Wed, 21 Apr 2021 20:17:12 GMT"
},
{
"version": "v7",
"created": "Mon, 10 May 2021 13:46:30 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Masopust",
"Tomáš",
""
],
[
"Krötzsch",
"Markus",
""
]
] |
new_dataset
| 0.994725 |
1910.06057
|
Matthias Hoelzel
|
Matthias Hoelzel and Richard Wilke
|
On the Union Closed Fragment of Existential Second-Order Logic and
Logics with Team Semantics
| null |
Logical Methods in Computer Science, Volume 17, Issue 3 (July 30,
2021) lmcs:6501
|
10.46298/lmcs-17(3:14)2021
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We present syntactic characterisations for the union closed fragments of
existential second-order logic and of logics with team semantics. Since union
closure is a semantical and undecidable property, the normal form we introduce
enables the handling and provides a better understanding of this fragment. We
also introduce inclusion-exclusion games that turn out to be precisely the
corresponding model-checking games. These games are not only interesting in
their own right, but they also are a key factor towards building a bridge
between the semantic and syntactic fragments. On the level of logics with team
semantics we additionally present restrictions of inclusion-exclusion logic to
capture the union closed fragment. Moreover, we define a team based atom that
when adding it to first-order logic also precisely captures the union closed
fragment of existential second-order logic which answers an open question by
Galliani and Hella.
|
[
{
"version": "v1",
"created": "Mon, 14 Oct 2019 11:53:22 GMT"
},
{
"version": "v2",
"created": "Thu, 21 May 2020 22:19:28 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jan 2021 11:00:22 GMT"
},
{
"version": "v4",
"created": "Thu, 29 Jul 2021 07:27:10 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Hoelzel",
"Matthias",
""
],
[
"Wilke",
"Richard",
""
]
] |
new_dataset
| 0.996657 |
2001.00758
|
Mateus de Oliveira
|
Mateus de Oliveira Oliveira
|
On Supergraphs Satisfying CMSO Properties
| null |
Logical Methods in Computer Science, Volume 17, Issue 4 (November
29, 2021) lmcs:6016
|
10.46298/lmcs-17(4:14)2021
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Let CMSO denote the counting monadic second order logic of graphs. We give a
constructive proof that for some computable function $f$, there is an algorithm
$\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive
integer $t$, and a connected graph $G$ of maximum degree at most $\Delta$, and
determines, in time $f(|\varphi|,t)\cdot 2^{O(\Delta \cdot t)}\cdot
|G|^{O(t)}$, whether $G$ has a supergraph $G'$ of treewidth at most $t$ such
that $G'\models \varphi$. The algorithmic metatheorem described above sheds new
light on certain unresolved questions within the framework of graph completion
algorithms. In particular, using this metatheorem, we provide an explicit
algorithm that determines, in time $f(d)\cdot 2^{O(\Delta \cdot d)}\cdot
|G|^{O(d)}$, whether a connected graph of maximum degree $\Delta$ has a planar
supergraph of diameter at most $d$. Additionally, we show that for each fixed
$k$, the problem of determining whether $G$ has an $k$-outerplanar supergraph
of diameter at most $d$ is strongly uniformly fixed parameter tractable with
respect to the parameter $d$. This result can be generalized in two directions.
First, the diameter parameter can be replaced by any contraction-closed
effectively CMSO-definable parameter $\mathbf{p}$. Examples of such parameters
are vertex-cover number, dominating number, and many other
contraction-bidimensional parameters. In the second direction, the planarity
requirement can be relaxed to bounded genus, and more generally, to bounded
local treewidth.
|
[
{
"version": "v1",
"created": "Fri, 3 Jan 2020 08:21:11 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Feb 2020 00:23:13 GMT"
},
{
"version": "v3",
"created": "Mon, 13 Sep 2021 13:00:10 GMT"
},
{
"version": "v4",
"created": "Mon, 25 Oct 2021 01:36:58 GMT"
},
{
"version": "v5",
"created": "Thu, 25 Nov 2021 07:50:40 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Oliveira",
"Mateus de Oliveira",
""
]
] |
new_dataset
| 0.9948 |
2001.07658
|
Tim A. C. Willemse
|
Jan Friso Groote and Tim A. C. Willemse
|
A symmetric protocol to establish service level agreements
| null |
Logical Methods in Computer Science, Volume 16, Issue 3 (September
30, 2020) lmcs:6044
|
10.23638/LMCS-16(3:19)2020
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We present a symmetrical protocol to repeatedly negotiate a desired service
level between two parties, where the service levels are taken from some totally
ordered finite domain. The agreed service level is selected from levels
dynamically proposed by both parties and parties can only decrease the desired
service level during a negotiation. The correctness of the protocol is stated
using modal formulas and its behaviour is explained using behavioural
reductions of the external behaviour modulo weak trace equivalence and
divergence-preserving branching bisimulation. Our protocol originates from an
industrial use case and it turned out to be remarkably tricky to design
correctly.
|
[
{
"version": "v1",
"created": "Tue, 21 Jan 2020 17:17:57 GMT"
},
{
"version": "v2",
"created": "Fri, 17 Jul 2020 13:29:22 GMT"
},
{
"version": "v3",
"created": "Fri, 11 Sep 2020 12:42:47 GMT"
},
{
"version": "v4",
"created": "Mon, 28 Sep 2020 20:52:35 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Groote",
"Jan Friso",
""
],
[
"Willemse",
"Tim A. C.",
""
]
] |
new_dataset
| 0.998 |
2001.08478
|
Joerg Endrullis
|
J\"org Endrullis, Jan Willem Klop, Roy Overbeek
|
Star Games and Hydras
| null |
Logical Methods in Computer Science, Volume 17, Issue 2 (May 27,
2021) lmcs:6056
|
10.23638/LMCS-17(2:20)2021
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
The recursive path ordering is an established and crucial tool in term
rewriting to prove termination. We revisit its presentation by means of some
simple rules on trees (or corresponding terms) equipped with a 'star' as
control symbol, signifying a command to make that tree (or term) smaller in the
order being defined. This leads to star games that are very convenient for
proving termination of many rewriting tasks. For instance, using already the
simplest star game on finite unlabeled trees, we obtain a very direct proof of
termination of the famous Hydra battle, direct in the sense that there is not
the usual mention of ordinals. We also include an alternative road to setting
up the star games, using a proof method of Buchholz, adapted by van Oostrom,
resulting in a quantitative version of the star as control symbol. We conclude
with a number of questions and future research directions.
|
[
{
"version": "v1",
"created": "Thu, 23 Jan 2020 12:55:27 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Aug 2020 13:55:07 GMT"
},
{
"version": "v3",
"created": "Wed, 21 Apr 2021 16:17:29 GMT"
},
{
"version": "v4",
"created": "Wed, 26 May 2021 10:35:16 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Endrullis",
"Jörg",
""
],
[
"Klop",
"Jan Willem",
""
],
[
"Overbeek",
"Roy",
""
]
] |
new_dataset
| 0.987824 |
2002.01415
|
Arlene Casey J
|
Arlene Casey, Mike Bennett, Richard Tobin, Claire Grover, Iona Walker,
Lukas Engelmann, Beatrice Alex
|
Plague Dot Text: Text mining and annotation of outbreak reports of the
Third Plague Pandemic (1894-1952)
|
Journal of Data Mining & Digital Humanities 2021
|
Journal of Data Mining & Digital Humanities, HistoInformatics,
HistoInformatics (January 20, 2021) jdmdh:6071
|
10.46298/jdmdh.6071
| null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design of models that govern diseases in population is commonly built on
information and data gathered from past outbreaks. However, epidemic outbreaks
are never captured in statistical data alone but are communicated by
narratives, supported by empirical observations. Outbreak reports discuss
correlations between populations, locations and the disease to infer insights
into causes, vectors and potential interventions. The problem with these
narratives is usually the lack of consistent structure or strong conventions,
which prohibit their formal analysis in larger corpora. Our interdisciplinary
research investigates more than 100 reports from the third plague pandemic
(1894-1952) evaluating ways of building a corpus to extract and structure this
narrative information through text mining and manual annotation. In this paper
we discuss the progress of our ongoing exploratory project, how we enhance
optical character recognition (OCR) methods to improve text capture, our
approach to structure the narratives and identify relevant entities in the
reports. The structured corpus is made available via Solr enabling search and
analysis across the whole collection for future research dedicated, for
example, to the identification of concepts. We show preliminary visualisations
of the characteristics of causation and differences with respect to gender as a
result of syntactic-category-dependent corpus statistics. Our goal is to
develop structured accounts of some of the most significant concepts that were
used to understand the epidemiology of the third plague pandemic around the
globe. The corpus enables researchers to analyse the reports collectively
allowing for deep insights into the global epidemiological consideration of
plague in the early twentieth century.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2020 17:16:36 GMT"
},
{
"version": "v2",
"created": "Thu, 14 May 2020 19:16:54 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jan 2021 11:08:08 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Casey",
"Arlene",
""
],
[
"Bennett",
"Mike",
""
],
[
"Tobin",
"Richard",
""
],
[
"Grover",
"Claire",
""
],
[
"Walker",
"Iona",
""
],
[
"Engelmann",
"Lukas",
""
],
[
"Alex",
"Beatrice",
""
]
] |
new_dataset
| 0.998368 |
2002.01455
|
Martin Kreuzer
|
Julian Danner and Martin Kreuzer
|
A fault attack on the Niederreiter cryptosystem using binary irreducible
Goppa codes
|
20 pages
|
journal of Groups, complexity, cryptology, Volume 12, Issue 1
(March 20, 2020) gcc:6074
|
10.46298/jgcc.2020.12.1.6074
| null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A fault injection framework for the decryption algorithm of the Niederreiter
public-key cryptosystem using binary irreducible Goppa codes and classical
decoding techniques is described. In particular, we obtain low-degree
polynomial equations in parts of the secret key. For the resulting system of
polynomial equations, we present an efficient solving strategy and show how to
extend certain solutions to alternative secret keys. We also provide estimates
for the expected number of required fault injections, apply the framework to
state-of-the-art security levels, and propose countermeasures against this type
of fault attack.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2020 18:33:27 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Mar 2020 10:50:00 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Danner",
"Julian",
""
],
[
"Kreuzer",
"Martin",
""
]
] |
new_dataset
| 0.999319 |
2003.14342
|
Gabriel Nivasch
|
Jeff Erickson, Gabriel Nivasch, Junyan Xu
|
Fusible numbers and Peano Arithmetic
| null |
Logical Methods in Computer Science, Volume 18, Issue 3 (July 28,
2022) lmcs:8555
|
10.46298/lmcs-18(3:6)2022
| null |
cs.LO math.CO math.LO
|
http://creativecommons.org/licenses/by/4.0/
|
Inspired by a mathematical riddle involving fuses, we define the "fusible
numbers" as follows: $0$ is fusible, and whenever $x,y$ are fusible with
$|y-x|<1$, the number $(x+y+1)/2$ is also fusible. We prove that the set of
fusible numbers, ordered by the usual order on $\mathbb R$, is well-ordered,
with order type $\varepsilon_0$. Furthermore, we prove that the density of the
fusible numbers along the real line grows at an incredibly fast rate: Letting
$g(n)$ be the largest gap between consecutive fusible numbers in the interval
$[n,\infty)$, we have $g(n)^{-1} \ge F_{\varepsilon_0}(n-c)$ for some constant
$c$, where $F_\alpha$ denotes the fast-growing hierarchy. Finally, we derive
some true statements that can be formulated but not proven in Peano Arithmetic,
of a different flavor than previously known such statements: PA cannot prove
the true statement "For every natural number $n$ there exists a smallest
fusible number larger than $n$." Also, consider the algorithm "$M(x)$: if $x<0$
return $-x$, else return $M(x-M(x-1))/2$." Then $M$ terminates on real inputs,
although PA cannot prove the statement "$M$ terminates on all natural inputs."
|
[
{
"version": "v1",
"created": "Tue, 31 Mar 2020 16:25:09 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Apr 2020 17:41:44 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Sep 2020 07:46:22 GMT"
},
{
"version": "v4",
"created": "Sat, 2 Oct 2021 19:11:02 GMT"
},
{
"version": "v5",
"created": "Tue, 5 Oct 2021 15:59:44 GMT"
},
{
"version": "v6",
"created": "Tue, 15 Feb 2022 13:18:42 GMT"
},
{
"version": "v7",
"created": "Mon, 21 Feb 2022 09:39:15 GMT"
},
{
"version": "v8",
"created": "Fri, 27 May 2022 13:08:24 GMT"
},
{
"version": "v9",
"created": "Wed, 27 Jul 2022 15:06:06 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Erickson",
"Jeff",
""
],
[
"Nivasch",
"Gabriel",
""
],
[
"Xu",
"Junyan",
""
]
] |
new_dataset
| 0.999038 |
2004.13472
|
Peng Fu
|
Peng Fu, Kohei Kishida, Peter Selinger
|
Linear Dependent Type Theory for Quantum Programming Languages
| null |
Logical Methods in Computer Science, Volume 18, Issue 3 (September
7, 2022) lmcs:6930
|
10.46298/lmcs-18(3:28)2022
| null |
cs.PL cs.LO math.CT quant-ph
|
http://creativecommons.org/licenses/by/4.0/
|
Modern quantum programming languages integrate quantum resources and
classical control. They must, on the one hand, be linearly typed to reflect the
no-cloning property of quantum resources. On the other hand, high-level and
practical languages should also support quantum circuits as first-class
citizens, as well as families of circuits that are indexed by some classical
parameters. Quantum programming languages thus need linear dependent type
theory. This paper defines a general semantic structure for such a type theory
via certain fibrations of monoidal categories. The categorical model of the
quantum circuit description language Proto-Quipper-M by Rios and Selinger
(2017) constitutes an example of such a fibration, which means that the
language can readily be integrated with dependent types. We then devise both a
general linear dependent type system and a dependently typed extension of
Proto-Quipper-M, and provide them with operational semantics as well as a
prototype implementation.
|
[
{
"version": "v1",
"created": "Tue, 28 Apr 2020 13:11:06 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Nov 2020 18:38:54 GMT"
},
{
"version": "v3",
"created": "Thu, 2 Dec 2021 18:24:22 GMT"
},
{
"version": "v4",
"created": "Fri, 27 May 2022 17:45:18 GMT"
},
{
"version": "v5",
"created": "Fri, 17 Jun 2022 16:14:19 GMT"
},
{
"version": "v6",
"created": "Tue, 6 Sep 2022 14:00:55 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Fu",
"Peng",
""
],
[
"Kishida",
"Kohei",
""
],
[
"Selinger",
"Peter",
""
]
] |
new_dataset
| 0.985322 |
2006.12207
|
Francesco Dolce
|
Francesco Dolce and Edita Pelantov\'a
|
On morphisms preserving palindromic richness
| null |
Fundamenta Informaticae, Volume 185, Issue 1 (March 10, 2022)
fi:7243
| null | null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that each word of length $n$ contains at most $n+1$ distinct
palindromes. A finite rich word is a word with maximal number of palindromic
factors. The definition of palindromic richness can be naturally extended to
infinite words. Sturmian words and Rote complementary symmetric sequences form
two classes of binary rich words, while episturmian words and words coding
symmetric $d$-interval exchange transformations give us other examples on
larger alphabets. In this paper we look for morphisms of the free monoid, which
allow us to construct new rich words from already known rich words. We focus on
morphisms in Class $P_{ret}$. This class contains morphisms injective on the
alphabet and satisfying a particular palindromicity property: for every
morphism $\varphi$ in the class there exists a palindrome $w$ such that
$\varphi(a)w$ is a first complete return word to $w$ for each letter $a$. We
characterize $P_{ret}$ morphisms which preserve richness over a binary
alphabet. We also study marked $P_{ret}$ morphisms acting on alphabets with
more letters. In particular we show that every Arnoux-Rauzy morphism is
conjugated to a morphism in Class $P_{ret}$ and that it preserves richness.
|
[
{
"version": "v1",
"created": "Mon, 22 Jun 2020 13:01:15 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Mar 2021 10:49:46 GMT"
},
{
"version": "v3",
"created": "Mon, 21 Feb 2022 11:26:31 GMT"
},
{
"version": "v4",
"created": "Fri, 4 Mar 2022 20:14:50 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Dolce",
"Francesco",
""
],
[
"Pelantová",
"Edita",
""
]
] |
new_dataset
| 0.996677 |
2006.13635
|
Dan Frumin
|
Dan Frumin, Robbert Krebbers, Lars Birkedal
|
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained
Concurrency and Logical Atomicity
| null |
Logical Methods in Computer Science, Volume 17, Issue 3 (July 21,
2021) lmcs:6598
|
10.46298/lmcs-17(3:9)2021
| null |
cs.LO cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
We present a new version of ReLoC: a relational separation logic for proving
refinements of programs with higher-order state, fine-grained concurrency,
polymorphism and recursive types. The core of ReLoC is its refinement judgment
$e \precsim e' : \tau$, which states that a program $e$ refines a program $e'$
at type $\tau$. ReLoC provides type-directed structural rules and symbolic
execution rules in separation-logic style for manipulating the judgment,
whereas in prior work on refinements for languages with higher-order state and
concurrency, such proofs were carried out by unfolding the judgment into its
definition in the model. ReLoC's abstract proof rules make it simpler to carry
out refinement proofs, and enable us to generalize the notion of logically
atomic specifications to the relational case, which we call logically atomic
relational specifications.
We build ReLoC on top of the Iris framework for separation logic in Coq,
allowing us to leverage features of Iris to prove soundness of ReLoC, and to
carry out refinement proofs in ReLoC. We implement tactics for interactive
proofs in ReLoC, allowing us to mechanize several case studies in Coq, and
thereby demonstrate the practicality of ReLoC.
ReLoC Reloaded extends ReLoC (LICS'18) with various technical improvements, a
new Coq mechanization, and support for Iris's prophecy variables. The latter
allows us to carry out refinement proofs that involve reasoning about the
program's future. We also expand ReLoC's notion of logically atomic relational
specifications with a new flavor based on the HOCAP pattern by Svendsen et al.
|
[
{
"version": "v1",
"created": "Wed, 24 Jun 2020 11:15:20 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Jan 2021 17:40:07 GMT"
},
{
"version": "v3",
"created": "Tue, 20 Jul 2021 16:55:56 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Frumin",
"Dan",
""
],
[
"Krebbers",
"Robbert",
""
],
[
"Birkedal",
"Lars",
""
]
] |
new_dataset
| 0.999534 |
2006.16129
|
Philippe Malbos
|
Cameron Calk, Eric Goubault, Philippe Malbos, Georg Struth
|
Algebraic coherent confluence and higher globular Kleene algebras
| null |
Logical Methods in Computer Science, Volume 18, Issue 4 (November
28, 2022) lmcs:6743
|
10.46298/lmcs-18(4:9)2022
| null |
cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extend the formalisation of confluence results in Kleene algebras to a
formalisation of coherent confluence proofs. For this, we introduce the
structure of higher globular Kleene algebra, a higher-dimensional
generalisation of modal and concurrent Kleene algebra. We calculate a coherent
Church-Rosser theorem and a coherent Newman's lemma in higher Kleene algebras
by equational reasoning. We instantiate these results in the context of higher
rewriting systems modelled by polygraphs.
|
[
{
"version": "v1",
"created": "Mon, 29 Jun 2020 15:47:06 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Aug 2020 14:08:52 GMT"
},
{
"version": "v3",
"created": "Thu, 7 Apr 2022 17:38:54 GMT"
},
{
"version": "v4",
"created": "Tue, 19 Jul 2022 14:18:16 GMT"
},
{
"version": "v5",
"created": "Thu, 24 Nov 2022 14:53:24 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Calk",
"Cameron",
""
],
[
"Goubault",
"Eric",
""
],
[
"Malbos",
"Philippe",
""
],
[
"Struth",
"Georg",
""
]
] |
new_dataset
| 0.997262 |
2007.15478
|
Anthony W. Lin
|
Anthony W. Lin and Rupak Majumdar
|
Quadratic Word Equations with Length Constraints, Counter Systems, and
Presburger Arithmetic with Divisibility
|
arXiv admin note: substantial text overlap with arXiv:1805.06701
|
Logical Methods in Computer Science, Volume 17, Issue 4 (October
29, 2021) lmcs:6693
|
10.46298/lmcs-17(4:4)2021
| null |
cs.LO cs.FL
|
http://creativecommons.org/licenses/by/4.0/
|
Word equations are a crucial element in the theoretical foundation of
constraint solving over strings. A word equation relates two words over string
variables and constants. Its solution amounts to a function mapping variables
to constant strings that equate the left and right hand sides of the equation.
While the problem of solving word equations is decidable, the decidability of
the problem of solving a word equation with a length constraint (i.e., a
constraint relating the lengths of words in the word equation) has remained a
long-standing open problem. We focus on the subclass of quadratic word
equations, i.e., in which each variable occurs at most twice. We first show
that the length abstractions of solutions to quadratic word equations are in
general not Presburger-definable. We then describe a class of counter systems
with Presburger transition relations which capture the length abstraction of a
quadratic word equation with regular constraints. We provide an encoding of the
effect of a simple loop of the counter systems in the existential theory of
Presburger Arithmetic with divisibility (PAD). Since PAD is decidable (NP-hard
and is in NEXP), we obtain a decision procedure for quadratic words equations
with length constraints for which the associated counter system is flat (i.e.,
all nodes belong to at most one cycle). In particular, we show a decidability
result (in fact, also an NP algorithm with a PAD oracle) for a recently
proposed NP-complete fragment of word equations called regular-oriented word
equations, when augmented with length constraints. We extend this decidability
result (in fact, with a complexity upper bound of PSPACE with a PAD oracle) in
the presence of regular constraints.
|
[
{
"version": "v1",
"created": "Thu, 30 Jul 2020 14:18:25 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Aug 2020 22:42:24 GMT"
},
{
"version": "v3",
"created": "Mon, 7 Jun 2021 13:30:42 GMT"
},
{
"version": "v4",
"created": "Mon, 27 Sep 2021 08:45:49 GMT"
},
{
"version": "v5",
"created": "Wed, 6 Oct 2021 09:07:48 GMT"
},
{
"version": "v6",
"created": "Thu, 28 Oct 2021 14:21:13 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Lin",
"Anthony W.",
""
],
[
"Majumdar",
"Rupak",
""
]
] |
new_dataset
| 0.997865 |
2010.15030
|
Jonas Kastberg Hinrichsen
|
Jonas Kastberg Hinrichsen, Jesper Bengtson and Robbert Krebbers
|
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation
Logic
| null |
Logical Methods in Computer Science, Volume 18, Issue 2 (June 10,
2022) lmcs:6869
|
10.46298/lmcs-18(2:16)2022
| null |
cs.LO cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
Message passing is a useful abstraction for implementing concurrent programs.
For real-world systems, however, it is often combined with other programming
and concurrency paradigms, such as higher-order functions, mutable state,
shared-memory concurrency, and locks. We present Actris: a logic for proving
functional correctness of programs that use a combination of the aforementioned
features. Actris combines the power of modern concurrent separation logics with
a first-class protocol mechanism -- based on session types -- for reasoning
about message passing in the presence of other concurrency paradigms. We show
that Actris provides a suitable level of abstraction by proving functional
correctness of a variety of examples, including a channel-based merge sort, a
channel-based load-balancing mapper, and a variant of the map-reduce model,
using concise specifications. While Actris was already presented in a
conference paper (POPL'20), this paper expands the prior presentation
significantly. Moreover, it extends Actris to Actris 2.0 with a notion of
subprotocols -- based on session-type subtyping -- that permits additional
flexibility when composing channel endpoints, and that takes full advantage of
the asynchronous semantics of message passing in Actris. Soundness of Actris
2.0 is proven using a model of its protocol mechanism in the Iris framework. We
have mechanised the theory of Actris, together with custom tactics, as well as
all examples in the paper, in the Coq proof assistant.
|
[
{
"version": "v1",
"created": "Wed, 28 Oct 2020 15:06:50 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Oct 2021 09:32:10 GMT"
},
{
"version": "v3",
"created": "Wed, 20 Oct 2021 09:24:24 GMT"
},
{
"version": "v4",
"created": "Tue, 15 Mar 2022 11:09:29 GMT"
},
{
"version": "v5",
"created": "Wed, 8 Jun 2022 18:13:38 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Hinrichsen",
"Jonas Kastberg",
""
],
[
"Bengtson",
"Jesper",
""
],
[
"Krebbers",
"Robbert",
""
]
] |
new_dataset
| 0.999639 |
2011.14303
|
Naoki Kobayashi
|
Yo Mitani, Naoki Kobayashi and Takeshi Tsukada
|
A Probabilistic Higher-order Fixpoint Logic
| null |
Logical Methods in Computer Science, Volume 17, Issue 4 (December
2, 2021) lmcs:6939
|
10.46298/lmcs-17(4:15)2021
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce PHFL, a probabilistic extension of higher-order fixpoint logic,
which can also be regarded as a higher-order extension of probabilistic
temporal logics such as PCTL and the $\mu^p$-calculus. We show that PHFL is
strictly more expressive than the $\mu^p$-calculus, and that the PHFL
model-checking problem for finite Markov chains is undecidable even for the
$\mu$-only, order-1 fragment of PHFL. Furthermore the full PHFL is far more
expressive: we give a translation from Lubarsky's $\mu$-arithmetic to PHFL,
which implies that PHFL model checking is $\Pi^1_1$-hard and $\Sigma^1_1$-hard.
As a positive result, we characterize a decidable fragment of the PHFL
model-checking problems using a novel type system.
|
[
{
"version": "v1",
"created": "Sun, 29 Nov 2020 07:31:00 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Jun 2021 14:01:59 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Oct 2021 10:11:59 GMT"
},
{
"version": "v4",
"created": "Wed, 1 Dec 2021 08:34:17 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Mitani",
"Yo",
""
],
[
"Kobayashi",
"Naoki",
""
],
[
"Tsukada",
"Takeshi",
""
]
] |
new_dataset
| 0.962487 |
2011.15021
|
Daniel Gratzer
|
Daniel Gratzer, G.A. Kavvos, Andreas Nuyts, Lars Birkedal
|
Multimodal Dependent Type Theory
| null |
Logical Methods in Computer Science, Volume 17, Issue 3 (July 28,
2021) lmcs:7571
|
10.46298/lmcs-17(3:11)2021
| null |
cs.LO
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce MTT, a dependent type theory which supports multiple modalities.
MTT is parametrized by a mode theory which specifies a collection of modes,
modalities, and transformations between them. We show that different choices of
mode theory allow us to use the same type theory to compute and reason in many
modal situations, including guarded recursion, axiomatic cohesion, and
parametric quantification. We reproduce examples from prior work in guarded
recursion and axiomatic cohesion, thereby demonstrating that MTT constitutes a
simple and usable syntax whose instantiations intuitively correspond to
previous handcrafted modal type theories. In some cases, instantiating MTT to a
particular situation unearths a previously unknown type theory that improves
upon prior systems. Finally, we investigate the metatheory of MTT. We prove the
consistency of MTT and establish canonicity through an extension of recent
type-theoretic gluing techniques. These results hold irrespective of the choice
of mode theory, and thus apply to a wide variety of modal situations.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2020 17:23:34 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Jun 2021 13:08:02 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Jul 2021 13:34:30 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Gratzer",
"Daniel",
""
],
[
"Kavvos",
"G. A.",
""
],
[
"Nuyts",
"Andreas",
""
],
[
"Birkedal",
"Lars",
""
]
] |
new_dataset
| 0.985643 |
2102.11025
|
Emiliano Lorini
|
Emiliano Lorini
|
A Qualitative Theory of Cognitive Attitudes and their Change
|
Under consideration in Theory and Practice of Logic Programming
(TPLP)
|
Theory and Practice of Logic Programming 21 (2021) 428-458
|
10.1017/S1471068421000053
| null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a general logical framework for reasoning about agents' cognitive
attitudes of both epistemic type and motivational type. We show that it allows
us to express a variety of relevant concepts for qualitative decision theory
including the concepts of knowledge, belief, strong belief, conditional belief,
desire, conditional desire, strong desire and preference. We also present two
extensions of the logic, one by the notion of choice and the other by dynamic
operators for belief change and desire change, and we apply the former to the
analysis of single-stage games under incomplete information. We provide sound
and complete axiomatizations for the basic logic and for its two extensions.
The paper is under consideration in Theory and Practice of Logic Programming
(TPLP).
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2021 10:28:49 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Lorini",
"Emiliano",
""
]
] |
new_dataset
| 0.993678 |
2106.05473
|
Richard Garner
|
Richard Garner
|
Stream processors and comodels
| null |
Logical Methods in Computer Science, Volume 19, Issue 1 (January
12, 2023) lmcs:9204
|
10.46298/lmcs-19(1:2)2023
| null |
cs.LO math.CT
|
http://creativecommons.org/licenses/by/4.0/
|
In 2009, Hancock, Pattinson and Ghani gave a coalgebraic characterisation of
stream processors $A^\mathbb{N} \to B^\mathbb{N}$ drawing on ideas of
Brouwerian constructivism. Their stream processors have an intensional
character; in this paper, we give a corresponding coalgebraic characterisation
of extensional stream processors, i.e., the set of continuous functions
$A^\mathbb{N} \to B^\mathbb{N}$. Our account sites both our result and that of
op. cit. within the apparatus of comodels for algebraic effects originating
with Power-Shkaravska. Within this apparatus, the distinction between
intensional and extensional equivalence for stream processors arises in the
same way as the the distinction between bisimulation and trace equivalence for
labelled transition systems and probabilistic generative systems.
|
[
{
"version": "v1",
"created": "Thu, 10 Jun 2021 03:23:11 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Mar 2022 21:49:27 GMT"
},
{
"version": "v3",
"created": "Sun, 4 Dec 2022 21:05:09 GMT"
},
{
"version": "v4",
"created": "Fri, 9 Dec 2022 01:13:10 GMT"
},
{
"version": "v5",
"created": "Wed, 11 Jan 2023 15:37:37 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Garner",
"Richard",
""
]
] |
new_dataset
| 0.965869 |
2108.13113
|
Samuel Pastva
|
Nikola Bene\v{s}, Lubo\v{s} Brim, Samuel Pastva, David \v{S}afr\'anek
|
BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
| null |
Logical Methods in Computer Science, Volume 18, Issue 1 (March 10,
2022) lmcs:8427
|
10.46298/lmcs-18(1:38)2022
| null |
cs.DS
|
http://creativecommons.org/licenses/by/4.0/
|
Edge-coloured directed graphs provide an essential structure for modelling
and analysis of complex systems arising in many scientific disciplines (e.g.
feature-oriented systems, gene regulatory networks, etc.). One of the
fundamental problems for edge-coloured graphs is the detection of strongly
connected components, or SCCs. The size of edge-coloured graphs appearing in
practice can be enormous both in the number of vertices and colours. The large
number of vertices prevents us from analysing such graphs using explicit SCC
detection algorithms, such as Tarjan's, which motivates the use of a symbolic
approach. However, the large number of colours also renders existing symbolic
SCC detection algorithms impractical. This paper proposes a novel algorithm
that symbolically computes all the monochromatic strongly connected components
of an edge-coloured graph. In the worst case, the algorithm performs $O(p \cdot
n \cdot log~n)$ symbolic steps, where $p$ is the number of colours and $n$ is
the number of vertices. We evaluate the algorithm using an experimental
implementation based on binary decision diagrams (BDDs). Specifically, we use
our implementation to explore the SCCs of a large collection of coloured graphs
(up to $2^{48}$) obtained from Boolean networks -- a modelling framework
commonly appearing in systems biology.
|
[
{
"version": "v1",
"created": "Mon, 30 Aug 2021 10:47:07 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Feb 2022 14:21:27 GMT"
},
{
"version": "v3",
"created": "Wed, 9 Mar 2022 18:09:10 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Beneš",
"Nikola",
""
],
[
"Brim",
"Luboš",
""
],
[
"Pastva",
"Samuel",
""
],
[
"Šafránek",
"David",
""
]
] |
new_dataset
| 0.991491 |
2110.05412
|
Michael Mislove
|
Vikraman Choudhury, Marcelo Fiore
|
Free Commutative Monoids in Homotopy Type Theory
|
Appeared in MFPS'22
|
Electronic Notes in Theoretical Informatics and Computer Science,
Volume 1 - Proceedings of MFPS XXXVIII (February 22, 2023) entics:10492
|
10.46298/entics.10492
| null |
cs.LO math.CO math.CT math.LO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We develop a constructive theory of finite multisets in Homotopy Type Theory,
defining them as free commutative monoids. After recalling basic structural
properties of the free commutative-monoid construction, we formalise and
establish the categorical universal property of two, necessarily equivalent,
algebraic presentations of free commutative monoids using 1-HITs. These
presentations correspond to two different equational theories invariably
including commutation axioms. In this setting, we prove important structural
combinatorial properties of finite multisets. These properties are established
in full generality without assuming decidable equality on the carrier set.
As an application, we present a constructive formalisation of the relational
model of classical linear logic and its differential structure. This leads to
constructively establishing that free commutative monoids are conical
refinement monoids. Thereon we obtain a characterisation of the equality type
of finite multisets and a new presentation of the free commutative-monoid
construction as a set-quotient of the list construction. These developments
crucially rely on the commutation relation of creation/annihilation operators
associated with the free commutative-monoid construction seen as a
combinatorial Fock space.
|
[
{
"version": "v1",
"created": "Mon, 11 Oct 2021 16:59:16 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Dec 2022 13:11:21 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Feb 2023 16:46:30 GMT"
},
{
"version": "v4",
"created": "Wed, 15 Feb 2023 22:09:19 GMT"
},
{
"version": "v5",
"created": "Mon, 20 Feb 2023 15:48:12 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Choudhury",
"Vikraman",
""
],
[
"Fiore",
"Marcelo",
""
]
] |
new_dataset
| 0.981442 |
2111.04083
|
Bruno Courcelle
|
Bruno Courcelle
|
Order-theoretic trees: monadic second-order descriptions and regularity
|
32 pages, 6 figures
|
Fundamenta Informaticae, Volume 186, Issues 1-4: Trakhtenbrot's
centenary (October 21, 2022) fi:8690
| null | null |
cs.LO cs.DM
|
http://creativecommons.org/licenses/by/4.0/
|
An order-theoretic forest is a countable partial order such that the set of
elements larger than any element is linearly ordered. It is an order-theoretic
tree if any two elements have an upper-bound. The order type of a branch can be
any countable linear order. Such generalized infinite trees yield convenient
definitions of the rank-width and the modular decomposition of countable
graphs.
We define an algebra based on only four operations that generate up to
isomorphism and via infinite terms these order-theoretic trees and forests. We
prove that the associated regular objects, those defined by regular terms, are
exactly the ones that are the unique models of monadic second-order sentences.
|
[
{
"version": "v1",
"created": "Sun, 7 Nov 2021 13:21:46 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Jan 2022 16:02:50 GMT"
},
{
"version": "v3",
"created": "Sat, 27 Aug 2022 18:02:08 GMT"
},
{
"version": "v4",
"created": "Mon, 3 Oct 2022 19:19:37 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Courcelle",
"Bruno",
""
]
] |
new_dataset
| 0.967552 |
2111.09993
|
Sourav Halder
|
Sourav Halder, Jun Yamasaki, Shashank Acharya, Wenjun Kou, Guy Elisha,
Dustin A. Carlson, Peter J. Kahrilas, John E. Pandolfino, Neelesh A. Patankar
|
Esophageal virtual disease landscape using mechanics-informed machine
learning
|
26 pages, 17 figures
|
Artificial Intelligence in Medicine. 134 (2022) 102435
|
10.1016/j.artmed.2022.102435
| null |
cs.LG eess.IV physics.med-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pathogenesis of esophageal disorders is related to the esophageal wall
mechanics. Therefore, to understand the underlying fundamental mechanisms
behind various esophageal disorders, it is crucial to map the esophageal wall
mechanics-based parameters onto physiological and pathophysiological conditions
corresponding to altered bolus transit and supraphysiologic IBP. In this work,
we present a hybrid framework that combines fluid mechanics and machine
learning to identify the underlying physics of the various esophageal disorders
and maps them onto a parameter space which we call the virtual disease
landscape (VDL). A one-dimensional inverse model processes the output from an
esophageal diagnostic device called endoscopic functional lumen imaging probe
(EndoFLIP) to estimate the mechanical "health" of the esophagus by predicting a
set of mechanics-based parameters such as esophageal wall stiffness, muscle
contraction pattern and active relaxation of esophageal walls. The
mechanics-based parameters were then used to train a neural network that
consists of a variational autoencoder (VAE) that generates a latent space and a
side network that predicts mechanical work metrics for estimating
esophagogastric junction motility. The latent vectors along with a set of
discrete mechanics-based parameters define the VDL and form clusters
corresponding to the various esophageal disorders. The VDL not only
distinguishes different disorders but can also be used to predict disease
progression in time. Finally, we also demonstrate the clinical applicability of
this framework for estimating the effectiveness of a treatment and track
patient condition after a treatment.
|
[
{
"version": "v1",
"created": "Fri, 19 Nov 2021 01:02:14 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Halder",
"Sourav",
""
],
[
"Yamasaki",
"Jun",
""
],
[
"Acharya",
"Shashank",
""
],
[
"Kou",
"Wenjun",
""
],
[
"Elisha",
"Guy",
""
],
[
"Carlson",
"Dustin A.",
""
],
[
"Kahrilas",
"Peter J.",
""
],
[
"Pandolfino",
"John E.",
""
],
[
"Patankar",
"Neelesh A.",
""
]
] |
new_dataset
| 0.997948 |
2204.00905
|
Joydeb Pal
|
Sanjit Bhowmick, Alexandre Fotue Tabue, Joydeb Pal
|
On the $\ell$-DLIPs of codes over finite commutative rings
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/4.0/
|
Generalizing the linear complementary duals, the linear complementary pairs
and the hull of codes, we introduce the concept of $\ell$-dimension linear
intersection pairs ($\ell$-DLIPs) of codes over a finite commutative ring
$(R)$, for some positive integer $\ell$. In this paper, we study $\ell$-DLIP of
codes over $R$ in a very general setting by a uniform method. Besides, we
provide a necessary and sufficient condition for the existence of a non-free
(or free) $\ell$-DLIP of codes over a finite commutative Frobenius ring. In
addition, we obtain a generator set of the intersection of two constacyclic
codes over a finite chain ring, which helps us to get an important
characterization of $\ell$-DLIP of constacyclic codes. Finally, the $\ell$-DLIP
of constacyclic codes over a finite chain ring are used to construct new
entanglement-assisted quantum error correcting (EAQEC) codes.
|
[
{
"version": "v1",
"created": "Sat, 2 Apr 2022 17:20:14 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jun 2023 06:49:39 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Bhowmick",
"Sanjit",
""
],
[
"Tabue",
"Alexandre Fotue",
""
],
[
"Pal",
"Joydeb",
""
]
] |
new_dataset
| 0.967709 |
2204.14153
|
Michael Mislove
|
Stefan Zetzsche, Alexandra Silva, Matteo Sammartino
|
Guarded Kleene Algebra with Tests: Automata Learning
| null |
Electronic Notes in Theoretical Informatics and Computer Science,
Volume 1 - Proceedings of MFPS XXXVIII (February 28, 2023) entics:10505
|
10.46298/entics.10505
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra
with Tests (KAT) that arises by replacing the union and iteration operations of
KAT with predicate-guarded variants. GKAT is more efficiently decidable than
KAT and expressive enough to model simple imperative programs, making it
attractive for applications to e.g. network verification. In this paper, we
further explore GKAT's automata theory, and present GL*, an algorithm for
learning the GKAT automaton representation of a black-box, by observing its
behaviour. A complexity analysis shows that it is more efficient to learn a
representation of a GKAT program with GL* than with Angluin's existing L*
algorithm. We implement GL* and L* in OCaml and compare their performances on
example programs.
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2022 15:18:15 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jun 2022 15:00:44 GMT"
},
{
"version": "v3",
"created": "Fri, 16 Dec 2022 02:50:14 GMT"
},
{
"version": "v4",
"created": "Sun, 5 Feb 2023 23:29:31 GMT"
},
{
"version": "v5",
"created": "Wed, 15 Feb 2023 21:44:28 GMT"
},
{
"version": "v6",
"created": "Mon, 20 Feb 2023 16:18:57 GMT"
},
{
"version": "v7",
"created": "Tue, 21 Feb 2023 18:16:22 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Zetzsche",
"Stefan",
""
],
[
"Silva",
"Alexandra",
""
],
[
"Sammartino",
"Matteo",
""
]
] |
new_dataset
| 0.984432 |
2207.09934
|
Oskar Natan
|
Oskar Natan and Jun Miura
|
DeepIPC: Deeply Integrated Perception and Control for an Autonomous
Vehicle in Real Environments
|
Submitted to Robotics and Autonomous Systems
| null | null | null |
cs.RO cs.AI cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We propose DeepIPC, an end-to-end autonomous driving model that handles both
perception and control tasks in driving a vehicle. The model consists of two
main parts, perception and controller modules. The perception module takes an
RGBD image to perform semantic segmentation and bird's eye view (BEV) semantic
mapping along with providing their encoded features. Meanwhile, the controller
module processes these features with the measurement of GNSS locations and
angular speed to estimate waypoints that come with latent features. Then, two
different agents are used to translate waypoints and latent features into a set
of navigational controls to drive the vehicle. The model is evaluated by
predicting driving records and performing automated driving under various
conditions in real environments. The experimental results show that DeepIPC
achieves the best drivability and multi-task performance even with fewer
parameters compared to the other models. Codes will be published at
https://github.com/oskarnatan/DeepIPC.
|
[
{
"version": "v1",
"created": "Wed, 20 Jul 2022 14:20:35 GMT"
},
{
"version": "v2",
"created": "Tue, 2 Aug 2022 09:08:51 GMT"
},
{
"version": "v3",
"created": "Wed, 14 Dec 2022 14:08:57 GMT"
},
{
"version": "v4",
"created": "Wed, 5 Apr 2023 15:15:08 GMT"
},
{
"version": "v5",
"created": "Wed, 21 Jun 2023 11:31:28 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Natan",
"Oskar",
""
],
[
"Miura",
"Jun",
""
]
] |
new_dataset
| 0.997856 |
2209.05403
|
Hao Xu
|
Hao Xu, Kai-Kit Wong, Giuseppe Caire
|
MAC Wiretap Channels with Confidential and Open Messages: Improved
Achievable Region and Low-complexity Precoder Design
|
50 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates the achievable region and precoder design for
multiple access wiretap (MAC-WT) channels, where each user transmits both
secret and open (i.e., non-confidential) messages. All these messages are
intended for the legitimate receiver (or Bob for brevity) and the eavesdropper
(Eve) is interested only in the secret messages of all users. By allowing users
with zero secret message rate to act as conventional MAC channel users with no
wiretapping, we show that the achievable region of the discrete memoryless (DM)
MAC-WT channel given in [1] can be enlarged. In [1], the achievability was
proven by considering the two-user case, making it possible to prove a key
auxiliary lemma by directly using the Fourier-Motzkin elimination procedure.
However, this approach does not generalize to the case with any number of
users. In this paper, we provide a new region that generally enlarges that in
[1] and provide general achievability proof.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2022 16:54:26 GMT"
},
{
"version": "v2",
"created": "Wed, 21 Jun 2023 15:30:25 GMT"
}
] | 2023-06-22T00:00:00 |
[
[
"Xu",
"Hao",
""
],
[
"Wong",
"Kai-Kit",
""
],
[
"Caire",
"Giuseppe",
""
]
] |
new_dataset
| 0.99012 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.