Results 121 to 130 of about 17,772 (305)
Automated deduction in Topology: two different approaches
Le Matematiche, 1988 Two approaches to theorem proving in Topology are described and some research problems in the field are given.
Vincenzo Cutello
doaj
Prosocial behaviour in primary and secondary school students. Effects of the CYBUPRE intervention
British Educational Research Journal, EarlyView.Abstract Prosocial behaviour is regarded as a critical factor in reducing aggressive behaviours among peers, both in physical settings and virtual spaces. This variable facilitates the enhancement of social relationships, promoting empathy, deep listening, physical and verbal service, and even solidarity, among other benefits.
Mercedes Chicote‐Beato +3 more
wiley +1 more source
Using Automated Theorem Provers to Certify Auto-Generated Aerospace Software
, 2004 We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligations which are then processed by an automated first-order theorem prover (ATP)
Schumann, Johann +2 more
core
Restricted Tweedie stochastic block models
Canadian Journal of Statistics, EarlyView.Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +1 more source
Proving termination using abstract interpretation
, 2010 PhDOne way to develop more robust software is to use formal program verification. Formal program verification requires the construction of a formal mathematical proof of the programs correctness. In the past ten years or so there has been much progress
Chawdhary, Aziem A., Chawdhary, Aziem A
core
Theorem Proving via Uniform Proofs
, 2018 Alberto Momigliano.
Alberto Momigliano (5373446)
core +1 more source
When to prove theorems by analogy? [PDF]
, 1996 In recent years several computational systems and techniques for theorem proving by analogy have been developed. The obvious practical question, however, as to whether and when to use analogy has been neglected badly in these developments. This paper addresses this question, identifies situations where analogy is useful, and discusses the merits of ...
openaire +2 more sources
Rank‐based estimation of propensity score weights via subclassification
Canadian Journal of Statistics, EarlyView.Abstract Propensity score (PS) weighting estimators are widely used for causal effect estimation and enjoy desirable theoretical properties, such as consistency and potential efficiency under correct model specification. However, their performance can degrade in practice due to sensitivity to PS model misspecification.
Linbo Wang +3 more
wiley +1 more source
Formal Proof of a Machine Closed Theorem in Coq
Journal of Applied Mathematics, 2014 The paper presents a formal proof of a machine closed theorem of TLA+ in the theorem proving system Coq. A shallow embedding scheme is employed for the proof which is independent of concrete syntax.
Hai Wan +3 more
doaj +1 more source
Modular Redundancy for Theorem Proving
, 2000 . We introduce a notion of modular redundancy for theorem proving. It can be used to exploit redundancy elimination techniques (like tautology elimination, subsumption, demodulation or other more refined methods) in combination with arbitrary existing
Miquel Bofill +3 more
core +1 more source