Results 11 to 20 of about 523,591 (296)
Constraints and Theorem Proving
Symbolic constraints provide a convenient way of describing the connection between deduction at the level of ground formulae and the general inferences as they are computed by a prover on formulae with variables.
Ganzinger, H., Nieuwenhuis, R.
openaire +4 more sources
Interactive Solution Viewers for Automated Theorem Proving
This paper describes interactive viewers for TPTP format proofs and models generated by Automated Theorem Proving (ATP) systems.
Daniel Li +3 more
doaj +4 more sources
Probabilistic theorem proving [PDF]
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable elimination and belief propagation, neither of which take logical structure into account.
Vibhav Gogate, Pedro M. Domingos
openaire +4 more sources
Formal Analysis of Soft Errors using Theorem Proving [PDF]
Modeling and analysis of soft errors in electronic circuits has traditionally been done using computer simulations. Computer simulations cannot guarantee correctness of analysis because they utilize approximate real number representations and pseudo ...
Sofiène Tahar +2 more
doaj +1 more source
Dealing with Degeneracies in Automated Theorem Proving in Geometry
We report, through different examples, the current development in GeoGebra, a widespread Dynamic Geometry software, of geometric automated reasoning tools by means of computational algebraic geometry algorithms.
Zoltán Kovács +3 more
doaj +1 more source
On Quantified Modal Theorem Proving for Modeling Ethics [PDF]
In the last decade, formal logics have been used to model a wide range of ethical theories and principles with the goal of using these models within autonomous systems.
Naveen Sundar Govindarajulu +2 more
doaj +1 more source
Proving Quantum Programs Correct [PDF]
As quantum computing progresses steadily from theory into practice, programmers will face a common problem: How can they be sure that their code does what they intend it to do?
Hietala, Kesha +4 more
core +1 more source
Computer Theorem Proving and HoTT [PDF]
Theorem-proving is a one-player game. The history of computer programs being the players goes back to 1956 and the ‘LT’ LOGIC THEORY MACHINE of Newell, Shaw and Simon. In game-playing terms, the ‘initial position’ is the core set of axioms chosen for the
Joe Leslie-hurd +3 more
core +7 more sources
Some observations on the logical foundations of inductive theorem proving [PDF]
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a goal. Based on
Stefan Hetzl, Tin Lok Wong
doaj +1 more source
Applications of real number theorem proving in PVS [PDF]
This work is supported by funding from the EPSRC under grants EP/H500162, EP/F02309X and GR/S31242Real number theorem proving has many uses, particularly for verification of safety critical systems and systems for which design errors may be costly.
Martin, Ursula +7 more
core +1 more source

