English
Related papers

Related papers: Quantitative Linear Logic

200 papers

The ongoing progress in quantum technologies has fueled a sustained exploration of their potential applications across various domains. One particularly promising field is quantitative finance, where a central challenge is the pricing of…

Quantum Physics · Physics 2025-10-23 Fernando Alonso , Álvaro Leitao , Carlos Vázquez

Counting logics with a bounded number of variables form one of the central concepts in descriptive complexity theory. Although they restrict the number of variables that a formula can contain, the variables can be nested within scopes of…

Logic in Computer Science · Computer Science 2024-11-12 Simon Raßmann , Georg Schindling , Pascal Schweitzer

We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity:…

Logic in Computer Science · Computer Science 2009-09-29 Ugo Dal Lago

We have developed the Physics Inventory of Quantitative Literacy (PIQL) as a tool to measure students' quantitative literacy in the context of introductory physics topics. We present the results from various quantitative analyses used to…

In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of…

Logic in Computer Science · Computer Science 2025-07-23 Kostia Chardonnet , Alexis Saurin , Benoît Valiron

A recent strand of research in structural proof theory aims at exploring the notion of analytic calculi (i.e. those calculi that support general and modular proof-strategies for cut elimination), and at identifying classes of logics that…

Logic in Computer Science · Computer Science 2021-02-24 Jinsheng Chen , Giuseppe Greco , Alessandra Palmigiano , Apostolos Tzimoulis

Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and…

Logic in Computer Science · Computer Science 2025-10-14 Maximilian R. P. von Liechtenstein

We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previously studied by Hasuo---hence soundness against language…

Logic in Computer Science · Computer Science 2018-11-19 Natsuki Urabe , Ichiro Hasuo

Markov Logic Networks (MLN) and Probabilistic Soft Logic (PSL) are widely applied formalisms in Statistical Relational Learning, an emerging area in Artificial Intelligence that is concerned with combining logical and statistical AI.…

Artificial Intelligence · Computer Science 2016-06-30 Joohyung Lee , Yi Wang

Weighted logic programming, a generalization of bottom-up logic programming, is a well-suited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm's output space, such as a path…

Artificial Intelligence · Computer Science 2012-08-15 Shay B. Cohen , Robert J. Simmons , Noah A. Smith

Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both…

Logic in Computer Science · Computer Science 2017-04-25 Lauri Hella , Antti Kuusisto , Arne Meier , Jonni Virtema

The logical connectives typically found in programming languages are similar to their mathematical counterparts, yet different due to their short-circuit behaviour -- when evaluating them, the second argument is only evaluated if the first…

Logic in Computer Science · Computer Science 2015-10-20 Sander in 't Veld

Due to the importance of linear algebra and matrix operations in data analytics, there is significant interest in using relational query optimization and processing techniques for evaluating (sparse) linear algebra programs. In particular,…

Computational Complexity · Computer Science 2026-01-07 Thomas Muñoz , Cristian Riveros , Stijn Vansummeren

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

Logic · Mathematics 2010-06-14 Farzad Didehvar , Kaveh Ghasemloo , Massoud Pourmahdian

Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security. They are essential in characterizing the…

Programming Languages · Computer Science 2020-01-22 Alessandro Aldini

The paper introduces fuzzy linguistic logic programming, which is a combination of fuzzy logic programming, introduced by P. Vojtas, and hedge algebras in order to facilitate the representation and reasoning on human knowledge expressed in…

Logic in Computer Science · Computer Science 2009-04-06 Van Hung Le , Fei Liu , Dinh Khang Tran

Most fuzzy systems including fuzzy decision support and fuzzy control systems provide out-puts in the form of fuzzy sets that represent the inferred conclusions. Linguistic interpretation of such outputs often involves the use of linguistic…

Artificial Intelligence · Computer Science 2013-01-30 Ryszard Kowalczyk

Fault tree analysis is a vital method of assessing safety risks. It helps to identify potential causes of accidents, assess their likelihood and severity, and suggest preventive measures. Quantitative analysis of fault trees is often done…

Artificial Intelligence · Computer Science 2024-03-15 Thi Kim Nhung Dang , Milan Lopuhaä-Zwakenberg , Mariëlle Stoelinga

We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly…

Logic in Computer Science · Computer Science 2014-08-28 Daniel de Carvalho , Lorenzo Tortora de Falco

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

Artificial Intelligence · Computer Science 2015-09-30 Stefan Borgwardt , Rafael Peñaloza