Matches in SemOpenAlex for { <https://semopenalex.org/work/W2403284373> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W2403284373 abstract "This thesis is a study of search algorithms in automated reasoning with propositional logic: propositional satisfiability and maximum satisfiability. An application of propositional logic reasoning to bioluminescence tomography is introduced in the thesis. Propositional satisfiability (SAT for short) is the problem of deciding whether or not a propositional expression is satisfiable. Local search algorithms, incomplete in natural, are one of the most effective methods for solving hard SAT problems. A complete local search algorithm is presented, which adds new clauses from ordered resolution at each local minimum so local minima disappear gradually and a global optimal solution is easily found. The Maximum satisfiability problem (MAX-SAT for short) tries to find a truth assignment that satisfies the most clauses in a boolean expression. One of the most popular methods for MAX-SAT is based on branch-and-bound algorithms. Two new lower bound functions, which are consistently better than other lower bound functions, are introduced. Based on strongly connected components of the implication graph of a 2CNF formula, a new variable ordering and a simplification method are provided to improve performance. Bioluminescence tomography (BLT for short) was introduced in 2002 to study biological processes in vivo at the cellular and molecular levels. This technique uses the surface measurement data of a small animal to recover the location and strength of the bioluminescence source. In the thesis, a new multi-view and multi-spectral bioluminescence tomography system is introduced to reduce the capture time and compensate for the decay of the bioluminescence signal. A temperature-modulated BLT algorithm is introduced by heating a small volume of tissue to create a signal difference, which is only related to the bioluminescence source in the heated volume. A depth-limited depth-first search algorithm using propositional logic reasoning is proposed to solve the BLT optimization problem. In this search algorithm, more biological information can be used as constraints, and it helps to prune the solution space and improves the result. The experimental results show the new algorithm can robustly recover the bioluminescent source information." @default.
- W2403284373 created "2016-06-24" @default.
- W2403284373 creator A5039343417 @default.
- W2403284373 creator A5051700680 @default.
- W2403284373 creator A5090734356 @default.
- W2403284373 date "2006-01-01" @default.
- W2403284373 modified "2023-09-23" @default.
- W2403284373 title "A study on the search algorithms in propositional logic with an application in bioluminescence tomography" @default.
- W2403284373 hasPublicationYear "2006" @default.
- W2403284373 type Work @default.
- W2403284373 sameAs 2403284373 @default.
- W2403284373 citedByCount "0" @default.
- W2403284373 crossrefType "journal-article" @default.
- W2403284373 hasAuthorship W2403284373A5039343417 @default.
- W2403284373 hasAuthorship W2403284373A5051700680 @default.
- W2403284373 hasAuthorship W2403284373A5090734356 @default.
- W2403284373 hasConcept C11413529 @default.
- W2403284373 hasConcept C118615104 @default.
- W2403284373 hasConcept C134306372 @default.
- W2403284373 hasConcept C168773769 @default.
- W2403284373 hasConcept C186633575 @default.
- W2403284373 hasConcept C33923547 @default.
- W2403284373 hasConcept C41008148 @default.
- W2403284373 hasConcept C6943359 @default.
- W2403284373 hasConcept C69562738 @default.
- W2403284373 hasConcept C77553402 @default.
- W2403284373 hasConcept C80444323 @default.
- W2403284373 hasConceptScore W2403284373C11413529 @default.
- W2403284373 hasConceptScore W2403284373C118615104 @default.
- W2403284373 hasConceptScore W2403284373C134306372 @default.
- W2403284373 hasConceptScore W2403284373C168773769 @default.
- W2403284373 hasConceptScore W2403284373C186633575 @default.
- W2403284373 hasConceptScore W2403284373C33923547 @default.
- W2403284373 hasConceptScore W2403284373C41008148 @default.
- W2403284373 hasConceptScore W2403284373C6943359 @default.
- W2403284373 hasConceptScore W2403284373C69562738 @default.
- W2403284373 hasConceptScore W2403284373C77553402 @default.
- W2403284373 hasConceptScore W2403284373C80444323 @default.
- W2403284373 hasLocation W24032843731 @default.
- W2403284373 hasOpenAccess W2403284373 @default.
- W2403284373 hasPrimaryLocation W24032843731 @default.
- W2403284373 hasRelatedWork W146765414 @default.
- W2403284373 hasRelatedWork W1519524620 @default.
- W2403284373 hasRelatedWork W1530605120 @default.
- W2403284373 hasRelatedWork W1607919398 @default.
- W2403284373 hasRelatedWork W1631189970 @default.
- W2403284373 hasRelatedWork W1850315098 @default.
- W2403284373 hasRelatedWork W1990083896 @default.
- W2403284373 hasRelatedWork W2000038675 @default.
- W2403284373 hasRelatedWork W2084642537 @default.
- W2403284373 hasRelatedWork W2089805461 @default.
- W2403284373 hasRelatedWork W2102980637 @default.
- W2403284373 hasRelatedWork W2153143225 @default.
- W2403284373 hasRelatedWork W2219808903 @default.
- W2403284373 hasRelatedWork W2394349251 @default.
- W2403284373 hasRelatedWork W2594912772 @default.
- W2403284373 hasRelatedWork W2604674395 @default.
- W2403284373 hasRelatedWork W2984546510 @default.
- W2403284373 hasRelatedWork W2993327920 @default.
- W2403284373 hasRelatedWork W92682349 @default.
- W2403284373 hasRelatedWork W185426153 @default.
- W2403284373 isParatext "false" @default.
- W2403284373 isRetracted "false" @default.
- W2403284373 magId "2403284373" @default.
- W2403284373 workType "article" @default.