[2025-06-19, 0 new articles found for cs_LO Logic in Computer Sciencs].

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which may be redundant. A number of . [1/5].

Esaïe Bauer, Alexis Saurin."A uniform cut-elimination theorem for linear logics with fixed points and super exponentials"

niques from cyclic proof theory. We will prove soundness and completeness of this system with respect to the semantics and provide a primitive decision procedure together with a way to extract countermodels. [2/2].

We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309[.]00532, we enforce the second-order property of converse wellfoundedness by using tech. [1/2].

Justus Becker."A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic"

ppears when analyzing the cost of the machine. We then design an optimized machine for the positive $\lambda$-calculus, which we prove efficient. The optimization is based on a new slicing technique which is dual to the standard structure of machine environments. [3/3].

t rules out the recurrent issue of renaming chains, that often causes a quadratic time slowdown. In this paper, we define the natural abstract machine for the positive$\lambda$-calculus and show that it suffers from an inefficiency: the quadratic slowdown somehow rea. [2/3].

Wu's positive $\lambda$-calculus is a recent call-by-value $\lambda$-calculus with sharing coming from Miller and Wu's study of the proof-theoretical concept of focalization. Accattoli and Wu showed that it simplifies a technical aspect of the study of sharing; namely i. [1/3].

Beniamino Accattoli, Claudio Sacerdoti Coen, Jui-Hsuan Wu."Positive Sharing and Abstract Machines"

t, we obtain a reduction in the encoding size of a scheduling problem posed by Mayank and Modal (2020) from $O(NMT^2)$ to $O(NMT + M T^2 \lg T)$, where $N$ is the number of tasks, $T$ the total timespan, and $M$ the number of machines. [4/4].

ow a novel encoding for independent sets in some dense interval graphs using only $O(|V| \lg |V|)$ clauses (the direct encoding uses $\Omega(|V|^2)$), which we have successfully applied to a string-compression encoding posed by Bannai et al. (2022). As a direct byproduc. [3/4].

a simple consequence of a result of Erd\H{o}s, Chung, and Spencer (1983) about biclique coverings of graphs, and opens theoretical avenues to understand the success of "Bounded Variable Addition'' (Manthey, Heule, and Biere, 2012) as a preprocessing tool. Finally, we sh. [2/4].

We show how several graph problems (e[.]g[.], vertex-cover, independent-set, $k$-coloring) can be encoded into CNF using only $O(|V|^2 / \lg |V|)$ many clauses, as opposed to the $\Omega(|V|^2)$ constraints used by standard encodings. This somewhat surprising result is . [1/4].

Bernardo Subercaseaux."Asymptotically Smaller Encodings for Graph Problems and Scheduling"

We propose in these notes a new proof system for first-order matching logic with application, obtained by adapting to matching logic G\"{o}del's proof system for first-order intuitionistic logic. [1/1].

Laurenţiu Leuştean, Dafina Trufaş."Matching logic -- proof system $\mathcal{G}^c$"

[2025-06-17, 10 new articles found for cs_LO Logic in Computer Sciencs].

t be explained or audited (crucial aspects for trustworthiness). On the other hand, rule-based reasoners, such as Cyc, are able to provide the chain of reasoning steps but are complex and use a large number of reasoners. We propose a middle ground using s(CASP), a goal-. [2/5].

Current advances in AI and its applicability have highlighted the need to ensure its trustworthiness for legal, ethical, and even commercial reasons. Sub-symbolic machine learning algorithms, such as the LLMs, simulate reasoning but hallucinate and their decisions canno. [1/5].