Contact
How to shop
Delivery
Shopping guide
Set Theory for Knowledge Representation
Set-Theoretical Languages for Reasoning in Knowledge Domains
English
127 b
Up to 30 days for returns
Customers also purchased
/
Paperback
18.84
€
36.84 лв
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
10.24
€
20.03 лв
/
Paperback
10.24
€
20.03 лв
/
Paperback
34.15
€
66.79 лв
Hi! I'm Libroamiko, your book advisor.
How can I help you?