A novel asynchronous parallelism scheme for first-order logic

DOI10.1007/3-540-58156-1_35MaRDI QIDQ5210792zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4162292 (Why is no real title available?)
• scientific article; zbMATH DE number 4164187 (Why is no real title available?)
• scientific article; zbMATH DE number 53302 (Why is no real title available?)
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• 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
• scientific article; zbMATH DE number 4213423 (Why is no real title available?)

Describes a project that uses

Uses Software

• METEOR
• PARTHEO

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)