Results 21 to 30 of about 38,933 (219)
Automated verification of refinement laws [PDF]
Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-weight variant of the refinement calculus, their intended semantics are positively disjunctive predicate transformers, and their calculus is entirely within ...
Hofner, P., Struth, G., Sutcliffe, G.
core +1 more source
Simplification Method for Contradiction Separation Clause in First-order Logic AutomatedTheorem Prover CSE [PDF]
First-order logic automated theorem proving has the capacity to resolve a multitude of practical problems after formalization,and thus holds considerable practical value.As an advancement in automated theorem proving,contradiction separation deduction ...
WU Xin, CHEN Shuwei, JIANG Shipan
doaj +1 more source
Proof Pad: A New Development Environment for ACL2 [PDF]
Most software development projects rely on Integrated Development Environments (IDEs) based on the desktop paradigm, with an interactive, mouse-driven user interface.
Caleb Eggensperger
doaj +1 more source
The modal logic of Reverse Mathematics [PDF]
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way.
Mummert, Carl +2 more
core +1 more source
Another look at automated theorem-proving II
I continue the discussion initiated in part I (published in this journal in 2007) of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments.
Koblitz Neal
doaj +1 more source
Reinforcement Learning for Guiding the E Theorem Prover
Automated Theorem Proving (ATP) systems search for a proof in a rapidly growing space of possibilities. Heuristics have a profound impact on search, and ATP systems make heavy use of heuristics.
Jack McKeown, Geoff Sutcliffe
doaj +1 more source
Alternation-Trading Proofs, Linear Programming, and Lower Bounds [PDF]
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models.
Williams, Ryan
core +6 more sources
GUBS, a Behaviour-Based Language for Design in Synthetic Biology [PDF]
In this article, we propose a domain specific language, GUBS (Genomic Unified Behaviour Specification), dedicated to the behavioural specification of synthetic biological devices, viewed as discrete open dynamical systems.
A. Basso-Blandin, F. Delaplace
doaj +1 more source
Recently developed GeoGebra tools for the automated deduction and discovery of geometric statements combine in a unique way computational (real and complex) algebraic geometry algorithms and graphic features for the introduction and visualization of ...
Tomás Recio +3 more
doaj +1 more source
Automated Generation of User Guidance by Combining Computation and Deduction [PDF]
Herewith, a fairly old concept is published for the first time and named "Lucas Interpretation". This has been implemented in a prototype, which has been proved useful in educational practice and has gained academic relevance with an emerging generation ...
Walther Neuper
doaj +1 more source

