scientific article; zbMATH DE number 7680806

DOI10.22028/D291-24908zbMath1509.68301MaRDI QIDQ6488530

Hans-Jürgen Bürckert

Publication date: 28 April 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (6)

A resolution principle for constrained logics ⋮ Theorem proving modulo ⋮ Combination techniques and decision problems for disunification ⋮ Theorem proving in cancellative abelian monoids (extended abstract) ⋮ A method for simultaneous search for refutations and models by equational constraint solving ⋮ Combination techniques and decision problems for disunification

Cites Work

• Investigations in many-sorted quantor logic
• Computational aspects of an order-sorted logic with term declarations
• Automated deduction by theory resolution
• The undecidability of the D_A-unification problem
• A Machine-Oriented Logic Based on the Resolution Principle
• Equality, types, modules, and (why not?) generics for logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: