A novel asynchronous parallelism scheme for first-order logic

DOI10.1007/3-540-58156-1_35zbMATH Open1433.68568OpenAlexW1599727345MaRDI QIDQ5210792FDOQ5210792

Authors: 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

Recommendations

• Nagging: A distributed, adversarial search-pruning technique applied to first-order inference
• Nagging: A scalable fault-tolerant paradigm for distributed search
• Parallelism in deductive inference on graph structures
• A system of parallel inference with the use of a connection graph
• Parallelization of a hyper-linking-based theorem prover

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• Title not available (Why is that?)
• Title not available (Why is that?)
• The deevolution of concurrent logic programming languages

Cited In (5)

• Nagging: A scalable fault-tolerant paradigm for distributed search
• Asynchronous process calculi: The first- and higher-order paradigms
• An optimal multiprocessor combinatorial auction solver
• Aligning the representation and reality of computation with asynchronous logic automata
• Title not available (Why is that?)

Uses Software

• PARTHEO
• METEOR

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210792)