English
Related papers

Related papers: ProofFlow: Flow Diagrams for Proofs

200 papers

Large language models (LLMs) represent words through contextual word embeddings encoding different language properties like semantics and syntax. Understanding these properties is crucial, especially for researchers investigating language…

Computation and Language · Computer Science 2025-04-16 Rita Sevastjanova , Robin Gerling , Thilo Spinner , Mennatallah El-Assady

The article describes the CFD software tool FlowVision (OOO "Tesis", Moscow). The model equations used for this research are the set of Reynolds and continuity equations and equations of the standard k - e turbulence model. The aim of the…

Fluid Dynamics · Physics 2007-05-23 Alexey N. Kochevsky

We describe here our perception of complex systems, of how we feel the different layers of description are important part of a correct complex system simulation. We describe a rough models categorization between rules based and law based,…

Fluid Dynamics · Physics 2007-12-18 Pierrick Tranouez , Cyrille Bertelle , Damien Olivier

Among the most general structures extending the framework by Dung are the abstract dialectical frameworks (ADFs). They come equipped with various types of semantics, with the most prominent - the labeling-based one - analyzed in the context…

Artificial Intelligence · Computer Science 2016-07-05 Sylwia Polberg

Linear logic and the linear {\lambda}-calculus have a long standing tradition in the study of natural language form and meaning. Among the proof calculi of linear logic, proof nets are of particular interest, offering an attractive…

Computation and Language · Computer Science 2021-01-19 Konstantinos Kogkalidis , Michael Moortgat , Richard Moot

This paper describes a procedure that system developers can follow to translate typical mathematical representations of linearized control systems into logic theories. These theories are then used to verify system requirements and find…

Logic in Computer Science · Computer Science 2021-08-09 Andrea Domenici , Cinzia Bernardeschi

Coinduction refers to both a technique for the definition of infinite streams, so-called codata, and a technique for proving the equality of coinductively specified codata. This article first reviews coinduction in declarative programming.…

Programming Languages · Computer Science 2020-07-23 François Bry

Given a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t. The coefficients which appear in these formulas can be…

Complex Variables · Mathematics 2009-02-02 David Wright , Wenhua Zhao

ProofPeer strives to be a system for cloud-based interactive theorem proving. After illustrating why such a system is needed, the paper presents some of the design challenges that ProofPeer needs to meet to succeed. Contexts are presented…

Mathematical Software · Computer Science 2012-01-04 Steven Obua

We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem…

Human-Computer Interaction · Computer Science 2018-03-06 Mario Frank , Christoph Kreitz

Normalizing flows model probability distributions through an expressive tractable density. They transform a simple base distribution, such as a Gaussian, through a sequence of invertible functions, which are referred to as layers. These…

A number of flexible tactic-based logical frameworks are nowadays available that can implement a wide range of mathematical theories using a common higher-order metalanguage. Used as proof assistants, one of the advantages of such powerful…

Logic in Computer Science · Computer Science 2010-03-26 João Marcos

The use of a functional language to implement proof strategies as proof tactics in interactive theorem provers, often provides short, concise and elegant implementations. Whilst being elegant, the use of higher order features and combinator…

Logic in Computer Science · Computer Science 2016-12-16 Yuhui Lin , Gudmund Grov , Rob Arthan

In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…

Logic in Computer Science · Computer Science 2012-10-23 Roberto Maieli

In this paper we provide a comprehensive introduction to knowledge graphs, which have recently garnered significant attention from both industry and academia in scenarios that require exploiting diverse, dynamic, large-scale collections of…

Recent work by Clark et al. (2020) shows that transformers can act as 'soft theorem provers' by answering questions over explicitly provided knowledge in natural language. In our work, we take a step closer to emulating formal theorem…

Computation and Language · Computer Science 2020-10-07 Swarnadeep Saha , Sayan Ghosh , Shashank Srivastava , Mohit Bansal

The potential influence diagram is a generalization of the standard "conditional" influence diagram, a directed network representation for probabilistic inference and decision analysis [Ndilikilikesha, 1991]. It allows efficient inference…

Artificial Intelligence · Computer Science 2013-03-08 Ross D. Shachter , Pierre Ndilikilikesha

The search for linguistic patterns, stylometry and forensic linguistics have in the theory of complex networks, their structures and associated mathematical tools, allies with which to model and analyze texts. In this paper we present a new…

Combinatorics · Mathematics 2022-09-14 Angeles Criado-Alonso , David Aleja , Miguel Romance , Regino Criado

This short paper gives an introduction to a research project to analyze how digital documents are structured and described. Using a phenomenological approach, this research will reveal common patterns that are used in data, independent from…

Digital Libraries · Computer Science 2014-08-12 Jakob Voß

The output of an automated theorem prover is usually presented by using a text format, they are often too heavy to be understood. In model checking setting, it would be helpful if one can observe the structure of models and the verification…

Logic in Computer Science · Computer Science 2017-02-16 Jian Liu , Ying Jiang , Yanyun Chen , Qing Zhou
‹ Prev 1 8 9 10 Next ›