crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 844300

Časopis

Autori: Maretić, Marcel
Naslov: On Satisfiability Trees
( On Satisfiability Trees )
Izvornik: International Journal of Applied Mathematics (1311-1728) 29 (2016), 5; 569-582
Vrsta rada: članak
Ključne riječi: satisfiabilty tree ; semantic tree ; tableau ; rooted formula tree ; matching ; resolution
( satisfiabilty tree ; semantic tree ; tableau ; rooted formula tree ; matching ; resolution )
Sažetak:
We define a satisfiability tree in the context of classical propositional logic. Satisfiability tree is a structure inspired by the Beth’s semantic tableau, later refined into its modern variant by Lis and Smullyan and by the notion that tableau is a tree-like representation of a formula. Basic notions and simple graph operations that correspond to logical operators are defined for satisfiability trees. Relation to tableau, parsing trees are investigated. Clausal satisfiability trees are defined as a class of satisfiability trees suited for formulas in clausal form. Issues related to size of clausal satisfiability trees are investigated. Non- redundant clausal satisfiability trees are shown to be a simple rewrite of Robinson’s refutation trees.
Izvorni jezik: eng
Rad je indeksiran u
bazama podataka:
Scopus
Kategorija: Znanstveni
Znanstvena područja:
Matematika
URL Internet adrese: http://www.diogenes.bg/ijam/contents/index.html
http://www.diogenes.bg/ijam/contents/2016-29-5/5/index.html
Broj citata:
Altmetric:
DOI: 10.12732/ijam.v29i5.5
URL cjelovitog teksta:
Google Scholar: On Satisfiability Trees
Upisao u CROSBI: Marcel Maretić (mmaretic@foi.hr), 14. Stu. 2016. u 15:37 sati



  Verzija za printanje   za tiskati


upomoc
foot_4