On structures of regular standard contradictions in propositional logic
From MaRDI portal
Publication:6154459
DOI10.1016/j.ins.2021.11.053OpenAlexW3216154863MaRDI QIDQ6154459
Xingxing He, Yanghe Feng, Yingfang Li
Publication date: 15 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.11.053
automated reasoningpropositional logiccontradiction structuresdeductive inference rulesregular standard contradictions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extraction of expansion trees
- Formalization of the resolution calculus for first-order logic
- A superposition calculus for abductive reasoning
- Contradiction separation based dynamic multi-clause synergized automated deduction
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments
- GKC: a reasoning system for large knowledge bases
- Long-distance Q-resolution with dependency schemes
- System Description: E 1.8
- History and Prospects for First-Order Automated Deduction
- iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
- Restricting backtracking in connection calculi
- On Matrices with Connections
- The 9th IJCAR Automated Theorem Proving System Competition – CASC-J9
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- A Machine-Oriented Logic Based on the Resolution Principle
- Automatic Theorem Proving With Renamable and Semantic Resolution
- A multi-clause dynamic deduction algorithm based on standard contradiction separation rule
This page was built for publication: On structures of regular standard contradictions in propositional logic
