Case-free programs: An abstraction of definite horn programs

DOI10.1007/3-540-52885-7_81zbMath1509.68325MaRDI QIDQ6488524

Thomas H. Payne, Toshiro Wakayama

Publication date: 28 April 2023

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

The applicability of logic program analysis and transformation to theorem proving

Cites Work

• Near-Horn prolog and beyond
• Non-Horn clause logic programming without contrapositives
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Mechanical Theorem-Proving by Model Elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Case-free programs: An abstraction of definite horn programs