Matches in SemOpenAlex for { <https://semopenalex.org/work/W2767658418> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2767658418 abstract "Author(s): Oztok, Umut | Advisor(s): Darwiche, Adnan | Abstract: Knowledge compilation is concerned with compiling problems encoded in some input language into some tractable, output language, with the goal of allowing one to solve such problems efficiently if the compilation is successful. This paradigm was originally motivated by the need to push much of the computational overhead into an offline compilation phase, which can then be amortized over a large number of queries in an online computation phase. In this dissertation, we study various new approaches to enhance the offline compilation phase, both theoretically and practically. We also study knowledge compilation from a perspective where it is employed as a general methodology for computation instead of just a paradigm that is concerned with the offline/online divide. In particular, we introduce a hierarchy of complexity parameters to bound the sizes of compiled representations. These new parameters are based on incorporating the logical content of the input representations, as opposed to existing parameters (e.g., treewidth) that are only based on the structure of the input. Our results improve some of the best known upper bounds on the compilation of influential representations, such as DNNFs, SDDs, and OBDDs. Moreover, we develop two new practical compilation algorithms for the DNNF and SDD languages, leading to orders of magnitude faster compilations. Finally, we study solving Beyond-NP problems using knowledge compilation, while particularly extending the reach of knowledge compilation to tackling problems in the highly intractable complexity class PP^PP. Our results show the applicability of knowledge compilers as black-box tools for solving Beyond-NP problems, similar to the use of SAT solvers for solving NP-complete problems." @default.
- W2767658418 created "2017-11-17" @default.
- W2767658418 creator A5049852449 @default.
- W2767658418 date "2017-01-01" @default.
- W2767658418 modified "2023-09-27" @default.
- W2767658418 title "Knowledge Compilation for Solving Computationally Hard Problems" @default.
- W2767658418 hasPublicationYear "2017" @default.
- W2767658418 type Work @default.
- W2767658418 sameAs 2767658418 @default.
- W2767658418 citedByCount "0" @default.
- W2767658418 crossrefType "journal-article" @default.
- W2767658418 hasAuthorship W2767658418A5049852449 @default.
- W2767658418 hasConcept C154945302 @default.
- W2767658418 hasConcept C162324750 @default.
- W2767658418 hasConcept C169590947 @default.
- W2767658418 hasConcept C199360897 @default.
- W2767658418 hasConcept C2777212361 @default.
- W2767658418 hasConcept C2779960059 @default.
- W2767658418 hasConcept C31170391 @default.
- W2767658418 hasConcept C34447519 @default.
- W2767658418 hasConcept C41008148 @default.
- W2767658418 hasConcept C45374587 @default.
- W2767658418 hasConcept C76782552 @default.
- W2767658418 hasConcept C80444323 @default.
- W2767658418 hasConceptScore W2767658418C154945302 @default.
- W2767658418 hasConceptScore W2767658418C162324750 @default.
- W2767658418 hasConceptScore W2767658418C169590947 @default.
- W2767658418 hasConceptScore W2767658418C199360897 @default.
- W2767658418 hasConceptScore W2767658418C2777212361 @default.
- W2767658418 hasConceptScore W2767658418C2779960059 @default.
- W2767658418 hasConceptScore W2767658418C31170391 @default.
- W2767658418 hasConceptScore W2767658418C34447519 @default.
- W2767658418 hasConceptScore W2767658418C41008148 @default.
- W2767658418 hasConceptScore W2767658418C45374587 @default.
- W2767658418 hasConceptScore W2767658418C76782552 @default.
- W2767658418 hasConceptScore W2767658418C80444323 @default.
- W2767658418 hasLocation W27676584181 @default.
- W2767658418 hasOpenAccess W2767658418 @default.
- W2767658418 hasPrimaryLocation W27676584181 @default.
- W2767658418 hasRelatedWork W128027222 @default.
- W2767658418 hasRelatedWork W1525902921 @default.
- W2767658418 hasRelatedWork W1732971744 @default.
- W2767658418 hasRelatedWork W1813119196 @default.
- W2767658418 hasRelatedWork W1982703133 @default.
- W2767658418 hasRelatedWork W2060978628 @default.
- W2767658418 hasRelatedWork W2114785958 @default.
- W2767658418 hasRelatedWork W2153822011 @default.
- W2767658418 hasRelatedWork W2229701631 @default.
- W2767658418 hasRelatedWork W2394839833 @default.
- W2767658418 hasRelatedWork W2396464753 @default.
- W2767658418 hasRelatedWork W2577196261 @default.
- W2767658418 hasRelatedWork W2943702877 @default.
- W2767658418 hasRelatedWork W2949884098 @default.
- W2767658418 hasRelatedWork W3090883344 @default.
- W2767658418 hasRelatedWork W3103993477 @default.
- W2767658418 hasRelatedWork W37712801 @default.
- W2767658418 hasRelatedWork W83435933 @default.
- W2767658418 hasRelatedWork W900043438 @default.
- W2767658418 hasRelatedWork W9945751 @default.
- W2767658418 isParatext "false" @default.
- W2767658418 isRetracted "false" @default.
- W2767658418 magId "2767658418" @default.
- W2767658418 workType "article" @default.