English
Related papers

Related papers: A Deep Inference System for Differential Linear Lo…

200 papers

Applying dynamic logics to program verifications is a challenge, because their axiomatic rules for regular expressions can be difficult to be adapted to different program models. We present a novel dynamic logic, called DLp, which supports…

Logic in Computer Science · Computer Science 2026-02-11 Yuanrui Zhang

We propose DISC-LawLLM, an intelligent legal system utilizing large language models (LLMs) to provide a wide range of legal services. We adopt legal syllogism prompting strategies to construct supervised fine-tuning datasets in the Chinese…

Computation and Language · Computer Science 2023-09-26 Shengbin Yue , Wei Chen , Siyuan Wang , Bingxuan Li , Chenchen Shen , Shujun Liu , Yuxuan Zhou , Yao Xiao , Song Yun , Xuanjing Huang , Zhongyu Wei

We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating backward proof search for the intuitionistic Strong L\"ob logic $\sf{iSL}$, an intuitionistic modal logic with a provability interpretation. A…

Logic in Computer Science · Computer Science 2023-09-04 Ian Shillito , Iris van der Giessen , Rajeev Goré , Rosalie Iemhoff

Temporal logic inference is the process of extracting formal descriptions of system behaviors from data in the form of temporal logic formulas. The existing temporal logic inference methods mostly neglect uncertainties in the data, which…

Artificial Intelligence · Computer Science 2021-06-01 Nasim Baharisangari , Jean-Raphaël Gaglione , Daniel Neider , Ufuk Topcu , Zhe Xu

Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent…

Computational Complexity · Computer Science 2017-01-11 Paola Bruscoli , Alessio Guglielmi , Tom Gundersen , Michel Parigot

Many learning algorithms such as kernel machines, nearest neighbors, clustering, or anomaly detection, are based on the concept of 'distance' or 'similarity'. Before similarities are used for training an actual machine learning model, we…

Infinitesimal contraction analysis provides exponential convergence rates between arbitrary pairs of trajectories of a system by studying the system's linearization. An essentially equivalent viewpoint arises through stability analysis of a…

Systems and Control · Electrical Eng. & Systems 2025-08-11 Akash Harapanahalli , Samuel Coogan

Diffusion large language models (dLLMs) offer capabilities beyond those of autoregressive (AR) LLMs, such as parallel decoding and random-order generation. However, realizing these benefits in practice is non-trivial, as dLLMs inherently…

Machine Learning · Computer Science 2026-01-30 Yu-Yang Qian , Junda Su , Lanxiang Hu , Peiyuan Zhang , Zhijie Deng , Peng Zhao , Hao Zhang

This paper employs the linear nested sequent framework to design a new cut-free calculus LNIF for intuitionistic fuzzy logic--the first-order G\"odel logic characterized by linear relational frames with constant domains. Linear nested…

Logic in Computer Science · Computer Science 2020-10-06 Tim Lyon

As a non-linear extension of the classic Linear Discriminant Analysis(LDA), Deep Linear Discriminant Analysis(DLDA) replaces the original Categorical Cross Entropy(CCE) loss function with eigenvalue-based loss function to make a deep neural…

Computer Vision and Pattern Recognition · Computer Science 2022-06-14 Wen Lu

Self-consistency boosts inference-time performance by sampling multiple reasoning traces in parallel and voting. However, in constrained domains like math and code, this strategy is compute-inefficient because it samples with replacement,…

Machine Learning · Computer Science 2026-04-23 Xueyan Li , Johannes Zenn , Ekaterina Fadeeva , Guinan Su , Mrinmaya Sachan , Jonas Geiping

In this paper we develop a statistical theory and an implementation of deep learning models. We show that an elegant variable splitting scheme for the alternating direction method of multipliers optimises a deep learning objective. We allow…

Machine Learning · Statistics 2015-09-22 Nicholas G. Polson , Brandon T. Willard , Massoud Heidari

Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with…

Cryptography and Security · Computer Science 2013-07-30 Felix Fontein , Michael Schneider , Urs Wagner

Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with…

Cryptography and Security · Computer Science 2012-12-21 Felix Fontein , Michael Schneider , Urs Wagner

Although more layers and more parameters generally improve the accuracy of the models, such big models generally have high computational complexity and require big memory, which exceed the capacity of small devices for inference and incurs…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-07-15 Ji Liu , Daxiang Dong , Xi Wang , An Qin , Xingjian Li , Patrick Valduriez , Dejing Dou , Dianhai Yu

Linear discriminant analysis (LDA) is a popular tool for classification and dimension reduction. Limited by its linear form and the underlying Gaussian assumption, however, LDA is not applicable in situations where the data distribution is…

Machine Learning · Computer Science 2020-11-02 Yunqi Cai , Dong Wang

The concept of Label Distribution Learning (LDL) is a technique to stabilize classification and regression problems with ambiguous and/or imbalanced labels. A prototypical use-case of LDL is human age estimation based on profile images.…

Machine Learning · Computer Science 2022-09-07 Maurice Günder , Nico Piatkowski , Christian Bauckhage

Latent Dirichlet Allocation (LDA) is a three-level hierarchical Bayesian model for topic inference. In spite of its great success, inferring the latent topic distribution with LDA is time-consuming. Motivated by the transfer learning…

Machine Learning · Computer Science 2015-08-06 Dongxu Zhang , Tianyi Luo , Dong Wang , Rong Liu

We propose a new version of generalized probabilistic propositional logic, namely, discrete-continuous logic (DCL) in which every generalized proposition (GP) is represented as 2x2 nondiagonal positive matrix with unit trace. We demonstrate…

Physics and Society · Physics 2013-06-12 E. D. Vol

The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus. But its relation with the…

Logic in Computer Science · Computer Science 2011-01-25 Simona Ronchi Della Rocca , Alexis Saurin , Yiorgos Stavrinos , Anastasia Veneti
‹ Prev 1 8 9 10 Next ›