Results 61 to 70 of about 307,150 (181)

Theorem Proving Modulo Revised Version [PDF]

, 2003
Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of general interest because it permits to separate computations and ...
Dowek, Gilles, Hardin, Thérèse, Kirchner, Claude   +2 more
core   +1 more source

Analysis and Control of Partially Observed Discrete-Event Systems via Positively Constructed Formulas

Computation
This paper establishes a connection between control theory for partially observed discrete-event systems (DESs) and automated theorem proving (ATP) in the calculus of positively constructed formulas (PCFs).
Artem Davydov, Aleksandr Larionov, Nadezhda Nagul   +2 more
doaj   +1 more source

Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case

Discrete Analysis, 2017
Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case, Discrete Analysis 2017:5, 34 pp. Szemerédi's theorem, proved in 1975, asserts that for every positive integer $k$ and every $\delta>0$ there exists $n$ such that every subset
Sean Prendiville
doaj   +1 more source

A distributional approach to fractional Sobolev spaces and fractional variation: existence of blow-up

, 2019
We introduce the new space $BV^{\alpha}(\mathbb{R}^n)$ of functions with bounded fractional variation in $\mathbb{R}^n$ of order $\alpha \in (0, 1)$ via a new distributional approach exploiting suitable notions of fractional gradient and fractional ...
Comi, Giovanni E., Stefani, Giorgio
core   +1 more source

Δ1: An Automated Theorem Generator

International Journal of Computational Intelligence Systems
This paper introduces Δ1, a novel automated theorem generator for propositional and first-order logic that operates without a traditional built-in theorem prover.
Yang Xu, Hailin Guo, Shuwei Chen, Jun Liu   +3 more
doaj   +1 more source

ShZZaM

Proceedings of the International Florida Artificial Intelligence Research Society Conference
This paper describes ShZZaM, a tool that translates natural language to typed first-order logic, using Large Language Models (LLMs) and Automated Theorem Proving (ATP).
Geoff Sutcliffe, Danial Haroon
doaj  

The modal μ-calculus hierarchy over restricted classes of transition systems [PDF]

, 2017
We study the strictness of the modal μ-calculus hierarchy over some restricted classes of transition systems. First, we prove that over transitive systems the hierarchy collapses to the alternation-free fragment.
Alberucci, Luca, Facchini, Alessandro
core  

Cooperation between Top-Down and Bottom-Up Theorem Provers

, 2011
Top-down and bottom-up theorem proving approaches each have specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control but suffer from the lack of goal-orientation, whereas top-down provers are goal-oriented but often ...
Fuchs, D., Fuchs, M.
core   +1 more source

A First Class Boolean Sort in First-Order Theorem Proving and TPTP [PDF]

, 2015
To support reasoning about properties of programs operating with boolean values one needs theorem provers to be able to natively deal with the boolean sort. This way, program properties can be translated to first-order logic and theorem provers can be used to prove program properties efficiently.
Kotelnikov, Evgenii, Kovács, Laura, Voronkov, Andrei   +2 more
openaire   +4 more sources

Enhancing the charging power of quantum batteries

, 2017
Can collective quantum effects make a difference in a meaningful thermodynamic operation? Focusing on energy storage and batteries, we demonstrate that quantum mechanics can lead to an enhancement in the amount of work deposited per unit time, i.e., the ...
Binder, Felix C., Campaioli, Francesco, Céleri, Lucas C., Goold, John, Modi, Kavan, Pollock, Felix A., Vinjanampathy, Sai   +6 more
core   +1 more source