Detecting non-provable goals (Q5210774)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7154549

Language	Label	Description	Also known as
English	Detecting non-provable goals	scientific article; zbMATH DE number 7154549

Statements

scholarly article

0 references

Detecting non-provable goals (English)

0 references

zbMATH Open document ID

0 references

10.1007/3-540-58156-1_16

0 references

Stefan Brüning

0 references

Automated Deduction — CADE-12

0 references

publication date

21 January 2020

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-58156-1_16

0 references

0 references

0 references

0 references

0 references

An analysis of loop checking mechanisms for logic programs

0 references

Detecting non-provable goals

0 references

0 references

Properties of substitutions and unifications

0 references

Resolution methods for the decision problem

0 references

Satisfiability of the smallest binary program

0 references

Deriving descriptions of possible values of program variables by means of abstract interpretation

0 references

SETHEO: A high-performance theorem prover

0 references

0 references

Mechanical Theorem-Proving by Model Elimination

0 references

Theorem proving with abstraction

0 references

A Machine-Oriented Logic Based on the Resolution Principle

0 references

Controlling recursive inference

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5210774

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5210774&oldid=36553851"