A novel asynchronous parallelism scheme for first-order logic

DOI10.1007/3-540-58156-1_35zbMath1433.68568OpenAlexW1599727345MaRDI QIDQ5210792

David Sturgill, Alberto Maria Segre

Publication date: 21 January 2020

Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58156-1_35

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Nagging: A scalable fault-tolerant paradigm for distributed search ⋮ An optimal multiprocessor combinatorial auction solver

Uses Software

• PARTHEO
• METEOR

Cites Work

• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• The deevolution of concurrent logic programming languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A novel asynchronous parallelism scheme for first-order logic