Cristiano Longo

Set Theory for Knowledge Representation

Set-Theoretical Languages for Reasoning in Knowledge Domains

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Verlag: LAP Lambert Academic Publishing
• Seitenzahl: 72
• Englisch
• Abmessung: 220mm x 150mm
• ISBN-13: 9783659248719
• ISBN-10: 3659248711
• Artikelnr.: 36535186

Autorenporträt

The author is employed as software engineer in a small IT company in Sicily. In 2012 he took his PhD degree in Computer Science with a dissertation about applications of Computable Set Theory to Knowledge Representation. Before this, some of his research topics have been security protocols, reputation, and semantic web.