Evidence algorithm and inference search in first-order logics
From MaRDI portal
Publication:286802
DOI10.1007/s10817-015-9346-0zbMath1356.03055OpenAlexW2172979345MaRDI QIDQ286802
F. Blanchet-Sadri, M. Dambrine
Publication date: 26 May 2016
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-015-9346-0
modal logicfirst-order logicsequent calculusMaslov's inverse methodintuitionistic logicautomated theorem provingclassical logicclash-resolution methodevidence algorithminference search
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Logical analysis of emotions in text from natural language ⋮ Evidence algorithm and sad systems: past and possible future
Uses Software
Cites Work
- Evidential paradigm: the logical aspect
- What is the inverse method?
- Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system
- Untersuchungen über das logische Schliessen. I
- A variant of Herbrand's theorem for formulas in prenex form
- Automated Reasoning with Analytic Tableaux and Related Methods
- Mathematical Knowledge Management
- A Machine-Oriented Logic Based on the Resolution Principle
- Some problems in the theories of automata and artificial intelligence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Evidence algorithm and inference search in first-order logics