ladr 0.0.200911a-2.1 source package in Ubuntu
Changelog
ladr (0.0.200911a-2.1) unstable; urgency=medium * Non-maintainer upload. * Build-depend on libtool-bin. Closes: #761761. -- Matthias Klose <email address hidden> Thu, 09 Oct 2014 10:37:43 +0000
Upload details
- Uploaded by:
- Debian QA Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian QA Group
- Architectures:
- any
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Xenial | release | universe | math |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
ladr_0.0.200911a-2.1.dsc | 1.3 KiB | c0623c2dd7c8a8f76570db9d606f50f367bf6cd83ddc6c17a43d2e74def660aa |
ladr_0.0.200911a.orig.tar.gz | 1.7 MiB | c32bed5807000c0b7161c276e50d9ca0af0cb248df2c1affb2f6fc02471b51d0 |
ladr_0.0.200911a-2.1.debian.tar.xz | 18.9 KiB | 000d2791796f1dabcfb366f284760bb59d4d66b10c8dd81cc0e1c307ef129694 |
Available diffs
- diff from 0.0.200911a-2 to 0.0.200911a-2.1 (513 bytes)
No changes file available.
Binary packages built by this source
- ladr4-apps: No summary available for ladr4-apps in ubuntu vivid.
No description available for ladr4-apps in ubuntu vivid.
- libladr-dev: No summary available for libladr-dev in ubuntu vivid.
No description available for libladr-dev in ubuntu vivid.
- libladr4: the LADR deduction library
LADR (Library for Automated Deduction Research) is a library for
use in constructing theorem provers. Among other useful routines it
provides facilities for applying inference rules such as resolution
and paramodulation to clauses. LADR is used by the prover9 theorem
prover, and by the mace4 countermodel generator.
- prover9: theorem prover and countermodel generator
This package provides the Prover9 resolution/
paramodulation theorem
prover and the Mace4 countermodel generator.
.
Prover9 is an automated theorem prover for first-order and equational
logic. It is a successor of the Otter prover. Prover9 uses the
inference techniques of ordered resolution and paramodulation with
literal selection.
.
The program Mace4 searches for finite structures satisfying first-order
and equational statements, the same kind of statement that Prover9
accepts. If the statement is the denial of some conjecture, any
structures found by Mace4 are counterexamples to the conjecture.
.
Mace4 can be a valuable complement to Prover9, looking for
counterexamples before (or at the same time as) using Prover9 to search
for a proof. It can also be used to help debug input clauses and formulas
for Prover9.