| Articolul precedent |
| Articolul urmator |
 |
 616 1 |
| Ultima descărcare din IBN: 2018-09-01 02:01 |
 SM ISO690:2012LYALETSKY, Alexandre. Refutation Search and Literal Trees Calculi. In: Conference of Mathematical Society of the Republic of Moldova, 28 iunie - 2 iulie 2017, Chişinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2017, 4, pp. 125-128. ISBN 978-9975-71-915-5. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference of Mathematical Society of the Republic of Moldova 4, 2017 |
||||||
|
Conferința "Conference of Mathematical Society of the Republic of Moldova" Chişinău, Moldova, 28 iunie - 2 iulie 2017 | ||||||
|
||||||
| Pag. 125-128 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Special calculi which can be considered as extensions of the SLD and input resolutions on the case of sets of abitrary clauses are constructed for doing refutation in the form of tree-like structures. The results on their validity and completeness are given. |
||||||
| Cuvinte-cheie classical first-order clausal logic, clause, literal tree, SLD resolution, input resolution, refutation, satisfiability |
||||||
|
|
|
|
