Doprava zdarma při nákupu nad 1 499 Kč přes Zásilkovnu nebo PPL Box.

Zjistit stav objednávky

Staňte se součástí komunity milovníků knih z celého světa a získejte hromadu výhod. Založit účet zdarma

Doprava zdarma se Zásilkovnou nad 1 499 Kč

Kurýr DPD 69 Kč PPL shop 49 Kč Balíkovna 69 Kč PPL kurýr 74 Kč PPL box 39 Kč Balíkovna 49 Kč Výdejní místo DPD 49 Kč Zásilkovna 39 Kč

Kontakt

Jak nakupovat

Pomoc

Můj účet

▸ Prázdný :-(

Doprava zdarma při nákupu nad 1 499 Kč přes Zásilkovnu nebo PPL Box.

Set Theory for Knowledge Representation

Name: Set Theory for Knowledge Representation
Brand: LAP Lambert Academic Publishing
SKU: 06996728
Price: 1209 CZK
Availability: InStock
Author: Cristiano Longo
ISBN: 9783659248719

Set-Theoretical Languages for Reasoning in Knowledge Domains

Cristiano Longo

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 06996728

Nakladatelství LAP Lambert Academic Publishing, listopad 2011

The decision problem in set theory has been intensively investigated in the last decades, and decisi... Celý popis

Libristo kód: 06996728

121 b

1 209 Kč

U nakladatele na objednávku Odesíláme za 17-27 dnů

30 dní na vrácení zboží

Zákazníci také koupili

Curves Scotland Stefan Bogner

Brožovaná

393 Kč

Gool, gool, la porra quiere gol Darío Zepeda Galván

Brožovaná

1 603 Kč

Hasselblad Award 2016 Douglas Kniha

Pevná

891 Kč

Oltre il possibile. Un soldato, quattordici vette. La mia vita nella zona della morte Nims Purja

Brožovaná

445 Kč

Marx global Jan Hoff

Pevná

2 324 Kč

The decision problem in set theory has been intensively investigated in the last decades, and decision procedures or proofs of undecidability have been provided for several quantified and unquantified fragments of set theory. In this book we study the decision problem for three novel quantified fragments of set theory, which allow the explicit manipulation of ordered pairs. We present a decision procedure for each language of this family, and prove that all of these procedures are optimal (in the sense that they run in nondeterministic polynomial-time) when restricted to formulae with quantifier nesting bounded by a constant. The expressive power of languages of this family is then measured in terms of set-theoretical constructs they allow to express. In addition, these languages can be profitably employed in knowledge representation, since they allow to express a large amount description logic constructs.