Comparing Unification Algorithms in First-Order Theorem Proving

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-04617-9_55
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Theorem Proving in Higher Order Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Cryptographically Sound Theorem Proving

English

Mechanical Theorem Proving in Tarski’s Geometry

English

Automated Theorem Proving in a Chat Environment

EasyChair Preprints
2018English

The Complexity of Theorem-Proving Procedures

1971English

Strong First Order Electroweak Phase Transition in Gauge-Higgs Unification at Finite Temperature

Physical Review D
AstronomyPhysics
2020English

Proof Simplification and Automated Theorem Proving

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Modal Theorem Proving: An Equational Viewpoint

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
1992English

A Sturmian Theorem for First Order Partial Differential Equations

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1972English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy