DC pole | Wartość | Język |
dc.contributor.author | Kolany, Adam | - |
dc.date.accessioned | 2020-09-21T06:18:21Z | - |
dc.date.available | 2020-09-21T06:18:21Z | - |
dc.date.issued | 1997 | - |
dc.identifier.citation | Bulletin of the Section of Logic, Vol. 26, no. 1 (1997), s. 12-19 | pl_PL |
dc.identifier.issn | 2449-836X | - |
dc.identifier.issn | 0138-0680 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12128/16013 | - |
dc.description.abstract | Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countably many vertices and pairwise incomparable edges. Then, a general method of transforming the combinatorial problems into the satisfiability problem is shown. | pl_PL |
dc.language.iso | en | pl_PL |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/pl/ | * |
dc.subject | hypergraph | pl_PL |
dc.subject | satisfiability problem | pl_PL |
dc.subject | combinatorial problems | pl_PL |
dc.title | Representation theorems for hypergraph satisfiability | pl_PL |
dc.type | info:eu-repo/semantics/article | pl_PL |
Pojawia się w kolekcji: | Artykuły (WNŚiT)
|