Results 21 to 30 of about 307,150 (181)
Editorial introduction to J.UCS special issue Challenges for Smart Environments – Human-Centered Computing, Data Science, and Ambient Intelligence I [PDF]
Journal of Universal Computer Science, 2021 Modern technologies and various domains of human activities increasingly rely on data science to develop smarter and autonomous systems. This trend has already changed the whole landscape of the global economy becoming more AI-driven.
Nelson Baloian, José Pino
doaj +3 more sources
The Nagaev-Guivarc'h method via the Keller-Liverani theorem [PDF]
, 2010 The Nagaev-Guivarc'h method, via the perturbation operator theorem of Keller and Liverani, has been exploited in recent papers to establish local limit and Berry-Essen type theorems for unbounded functionals of strongly ergodic Markov chains.
Hervé, Loïc, Pène, Françoise
core +4 more sources
A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq
Sunil Kothari, James Caldwell
doaj +1 more source
Formalization of Cost and Utility in Microeconomics
Energies, 2020 Cost and utility modeling of economics agents based on the differential theory is fundamental to the analysis of the microeconomics models. In particular, the first and second-order derivative tests are used to specify the desired properties of the cost ...
Asad Ahmed +3 more
doaj +1 more source
First-Order Theorem Proving and Vampire [PDF]
, 2013 In this paper we give a short introduction in first-order theorem proving and the use of the theorem prover Vampire. We discuss the superposition calculus and explain the key concepts of saturation and redundancy elimination, present saturation algorithms and preprocessing, and demonstrate how these concepts are implemented in Vampire. Further, we also
Kovács, Laura, Voronkov, Andrei
openaire +1 more source
Essential Incompleteness of Arithmetic Verified by Coq [PDF]
, 2005 A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized.
J. Despeyroux +5 more
core +2 more sources
FEther: An Extensible Definitional Interpreter for Smart-Contract Verifications in Coq
IEEE Access, 2019 Recently, blockchain technology has been widely applied in the financial field. Therefore, the security of the blockchain smart contracts is among the most popular contemporary research topics.
Zheng Yang, Hang Lei
doaj +1 more source
Formalization of Linear Space Theory in the Higher-Order Logic Proving System
Journal of Applied Mathematics, 2013 Theorem proving is an important approach in formal verification. Higher-order logic is a form of predicate logic that is distinguished from first-order logic by additional quantifiers and stronger semantics. Higher-order logic is more expressive.
Jie Zhang, Danwen Mao, Yong Guan
doaj +1 more source
A first-order logic for string diagrams [PDF]
, 2015 Equational reasoning with string diagrams provides an intuitive means of proving equations between morphisms in a symmetric monoidal category. This can be extended to proofs of infinite families of equations using a simple graphical syntax called !-box ...
Kissinger, Aleks, Quick, David
core +2 more sources
Checkable Proofs for First-Order Theorem Proving
EPiC Series in Computing, 2018 Inspired by the success of the DRAT proof format for certification of boolean satisfiability (SAT),we argue that a similar goal of having unified automatically checkable proofs should be soughtby the developers of automated first-order theorem provers (ATPs).
Reger, Giles, Suda, Martin
openaire +2 more sources