Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(satisfiability)`

.
Showing records 1 – 30 of
174 total matches.

Search Limiters

Dates

- 2016 – 2020 (61)
- 2011 – 2015 (74)
- 2006 – 2010 (34)
- 2001 – 2005 (13)

Department

- Computer Science (13)
- Informatique (13)

Degrees

- PhD (46)
- Docteur es (16)
- MS (16)

▼ Search Limiters

Università della Svizzera italiana

1. Rollini, Simone Fulvio. Craig Interpolation and proof manipulation: Theory and applications to model checking.

Degree: 2013, Università della Svizzera italiana

URL: http://doc.rero.ch/record/209770

► Model checking is one of the most appreciated methods for automated formal verification of software and hardware systems. The main challenge in model checking, i.e.…
(more)

Subjects/Keywords: Satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rollini, S. F. (2013). Craig Interpolation and proof manipulation: Theory and applications to model checking. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/209770

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Rollini, Simone Fulvio. “Craig Interpolation and proof manipulation: Theory and applications to model checking.” 2013. Thesis, Università della Svizzera italiana. Accessed December 03, 2020. http://doc.rero.ch/record/209770.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rollini, Simone Fulvio. “Craig Interpolation and proof manipulation: Theory and applications to model checking.” 2013. Web. 03 Dec 2020.

Vancouver:

Rollini SF. Craig Interpolation and proof manipulation: Theory and applications to model checking. [Internet] [Thesis]. Università della Svizzera italiana; 2013. [cited 2020 Dec 03]. Available from: http://doc.rero.ch/record/209770.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rollini SF. Craig Interpolation and proof manipulation: Theory and applications to model checking. [Thesis]. Università della Svizzera italiana; 2013. Available from: http://doc.rero.ch/record/209770

Not specified: Masters Thesis or Doctoral Dissertation

Università della Svizzera italiana

2. Gagliolo, Matteo. Online Dynamic Algorithm Portfolios: minimizing the computational cost of problem solving.

Degree: 2010, Università della Svizzera italiana

URL: http://doc.rero.ch/record/20245

► This thesis presents methods for minimizing the computational effort of problem solving. Rather than looking at a particular algorithm, we consider the issue of computational…
(more)

Subjects/Keywords: Satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gagliolo, M. (2010). Online Dynamic Algorithm Portfolios: minimizing the computational cost of problem solving. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/20245

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gagliolo, Matteo. “Online Dynamic Algorithm Portfolios: minimizing the computational cost of problem solving.” 2010. Thesis, Università della Svizzera italiana. Accessed December 03, 2020. http://doc.rero.ch/record/20245.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gagliolo, Matteo. “Online Dynamic Algorithm Portfolios: minimizing the computational cost of problem solving.” 2010. Web. 03 Dec 2020.

Vancouver:

Gagliolo M. Online Dynamic Algorithm Portfolios: minimizing the computational cost of problem solving. [Internet] [Thesis]. Università della Svizzera italiana; 2010. [cited 2020 Dec 03]. Available from: http://doc.rero.ch/record/20245.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gagliolo M. Online Dynamic Algorithm Portfolios: minimizing the computational cost of problem solving. [Thesis]. Università della Svizzera italiana; 2010. Available from: http://doc.rero.ch/record/20245

Not specified: Masters Thesis or Doctoral Dissertation

3. Van der Tak, P. (author). Concurrent Cube-and-Conquer.

Degree: 2012, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:7a248cd8-7749-4bd5-a938-ed56a7bd9992

►

Recent work introduced the cube-and-conquer technique to solve hard SAT instances. It combines the two dominant SAT solving techniques: lookahead and conflict-driven clause learning (CDCL).… (more)

Subjects/Keywords: satisfiability

…Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.2 The *satisfiability*… …NP-complete boolean *satisfiability* (SAT) problem [4, 6] is in principle… …Introduction
1.2 The *satisfiability* problem
1.2 The *satisfiability* problem
The objective of the… …*satisfiability* problem is to find an assignment of boolean variables
x = {x1 , x2 , . . . , xn… …*satisfiability* or unsatisfiability for any SAT
instance given infinite resources. Incomplete solvers…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Van der Tak, P. (. (2012). Concurrent Cube-and-Conquer. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7a248cd8-7749-4bd5-a938-ed56a7bd9992

Chicago Manual of Style (16^{th} Edition):

Van der Tak, P (author). “Concurrent Cube-and-Conquer.” 2012. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:7a248cd8-7749-4bd5-a938-ed56a7bd9992.

MLA Handbook (7^{th} Edition):

Van der Tak, P (author). “Concurrent Cube-and-Conquer.” 2012. Web. 03 Dec 2020.

Vancouver:

Van der Tak P(. Concurrent Cube-and-Conquer. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:7a248cd8-7749-4bd5-a938-ed56a7bd9992.

Council of Science Editors:

Van der Tak P(. Concurrent Cube-and-Conquer. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:7a248cd8-7749-4bd5-a938-ed56a7bd9992

Colorado State University

4. Hains, Doug. Structure in combinatorial optimization and its effect on heuristic performance.

Degree: PhD, Computer Science, 2013, Colorado State University

URL: http://hdl.handle.net/10217/80944

► The goal in combinatorial optimization is to find a good solution among a finite set of solutions. In many combinatorial problems, the set of solutions…
(more)

Subjects/Keywords: combinatorial optimization; satisfiability; local search

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hains, D. (2013). Structure in combinatorial optimization and its effect on heuristic performance. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/80944

Chicago Manual of Style (16^{th} Edition):

Hains, Doug. “Structure in combinatorial optimization and its effect on heuristic performance.” 2013. Doctoral Dissertation, Colorado State University. Accessed December 03, 2020. http://hdl.handle.net/10217/80944.

MLA Handbook (7^{th} Edition):

Hains, Doug. “Structure in combinatorial optimization and its effect on heuristic performance.” 2013. Web. 03 Dec 2020.

Vancouver:

Hains D. Structure in combinatorial optimization and its effect on heuristic performance. [Internet] [Doctoral dissertation]. Colorado State University; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10217/80944.

Council of Science Editors:

Hains D. Structure in combinatorial optimization and its effect on heuristic performance. [Doctoral Dissertation]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/80944

McMaster University

5. Thong, Jason. FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing.

Degree: PhD, 2014, McMaster University

URL: http://hdl.handle.net/11375/16419

►

The Boolean *satisfiability* (SAT) problem is central to many applications involving the verification and optimization of digital systems. These combinatorial problems are typically solved by…
(more)

Subjects/Keywords: FPGA; heterogeneous computing; Boolean satisfiability; hardware acceleration

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Thong, J. (2014). FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/16419

Chicago Manual of Style (16^{th} Edition):

Thong, Jason. “FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing.” 2014. Doctoral Dissertation, McMaster University. Accessed December 03, 2020. http://hdl.handle.net/11375/16419.

MLA Handbook (7^{th} Edition):

Thong, Jason. “FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing.” 2014. Web. 03 Dec 2020.

Vancouver:

Thong J. FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing. [Internet] [Doctoral dissertation]. McMaster University; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11375/16419.

Council of Science Editors:

Thong J. FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing. [Doctoral Dissertation]. McMaster University; 2014. Available from: http://hdl.handle.net/11375/16419

University of Waterloo

6. Imeson, Frank. Robotic Path Planning for High-Level Tasks in Discrete Environments.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13082

► This thesis proposes two techniques for solving high-level multi-robot motion planning problems with discrete environments. We focus on an important class of problems that require…
(more)

Subjects/Keywords: Robotics; Path Planning; Satisfiability Modulo Theories; Clustering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Imeson, F. (2018). Robotic Path Planning for High-Level Tasks in Discrete Environments. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13082

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Imeson, Frank. “Robotic Path Planning for High-Level Tasks in Discrete Environments.” 2018. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/13082.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Imeson, Frank. “Robotic Path Planning for High-Level Tasks in Discrete Environments.” 2018. Web. 03 Dec 2020.

Vancouver:

Imeson F. Robotic Path Planning for High-Level Tasks in Discrete Environments. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/13082.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Imeson F. Robotic Path Planning for High-Level Tasks in Discrete Environments. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13082

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

7. Le, Bao. SAT-based Automated Design Debugging: Improvements and Application to Low-power Design.

Degree: 2012, University of Toronto

URL: http://hdl.handle.net/1807/33304

►

With the growing complexity of modern VLSI designs, design errors become increasingly common. Design debugging today emerges as a bottleneck in the design flow, consuming… (more)

Subjects/Keywords: Design Debugging; Boolean Satisfiability; CAD; 0544

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Le, B. (2012). SAT-based Automated Design Debugging: Improvements and Application to Low-power Design. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/33304

Chicago Manual of Style (16^{th} Edition):

Le, Bao. “SAT-based Automated Design Debugging: Improvements and Application to Low-power Design.” 2012. Masters Thesis, University of Toronto. Accessed December 03, 2020. http://hdl.handle.net/1807/33304.

MLA Handbook (7^{th} Edition):

Le, Bao. “SAT-based Automated Design Debugging: Improvements and Application to Low-power Design.” 2012. Web. 03 Dec 2020.

Vancouver:

Le B. SAT-based Automated Design Debugging: Improvements and Application to Low-power Design. [Internet] [Masters thesis]. University of Toronto; 2012. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1807/33304.

Council of Science Editors:

Le B. SAT-based Automated Design Debugging: Improvements and Application to Low-power Design. [Masters Thesis]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/33304

University of Colorado

8. Hassan, Zyad. Incremental, Inductive Model Checking.

Degree: PhD, Electrical, Computer & Energy Engineering, 2014, University of Colorado

URL: https://scholar.colorado.edu/ecen_gradetds/86

► Model checking has become a widely adopted approach for the verification of hardware designs. The ever increasing complexity of these designs creates a continuous…
(more)

Subjects/Keywords: Formal Verification; Model Checking; Satisfiability; Computer Engineering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hassan, Z. (2014). Incremental, Inductive Model Checking. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/86

Chicago Manual of Style (16^{th} Edition):

Hassan, Zyad. “Incremental, Inductive Model Checking.” 2014. Doctoral Dissertation, University of Colorado. Accessed December 03, 2020. https://scholar.colorado.edu/ecen_gradetds/86.

MLA Handbook (7^{th} Edition):

Hassan, Zyad. “Incremental, Inductive Model Checking.” 2014. Web. 03 Dec 2020.

Vancouver:

Hassan Z. Incremental, Inductive Model Checking. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2020 Dec 03]. Available from: https://scholar.colorado.edu/ecen_gradetds/86.

Council of Science Editors:

Hassan Z. Incremental, Inductive Model Checking. [Doctoral Dissertation]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/ecen_gradetds/86

University of Oxford

9.
Petke, Justyna.
On the bridge between constraint satisfaction and Boolean * satisfiability*.

Degree: PhD, 2012, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

► A wide range of problems can be formalized as a set of constraints that need to be satisfied. In fact, such a model is called…
(more)

Subjects/Keywords: 511.324; Computer Science; constraint satisfaction; Boolean satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Petke, J. (2012). On the bridge between constraint satisfaction and Boolean satisfiability. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

Chicago Manual of Style (16^{th} Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Doctoral Dissertation, University of Oxford. Accessed December 03, 2020. http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891.

MLA Handbook (7^{th} Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Web. 03 Dec 2020.

Vancouver:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2020 Dec 03]. Available from: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891.

Council of Science Editors:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

University of Toronto

10. Erdem, Ozan. Exploring a Two-Solver Architecture for Clause Learning CSP Solvers.

Degree: PhD, 2017, University of Toronto

URL: http://hdl.handle.net/1807/78955

► Many real world problems can be encoded as Constraint Satisfaction Problems (CSPs). Constraint satisfaction problems contain variables over finite domains, as well as constraints over…
(more)

Subjects/Keywords: Constraint Satisfaction Problems; Satisfiability Problem; Search; 0800

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Erdem, O. (2017). Exploring a Two-Solver Architecture for Clause Learning CSP Solvers. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/78955

Chicago Manual of Style (16^{th} Edition):

Erdem, Ozan. “Exploring a Two-Solver Architecture for Clause Learning CSP Solvers.” 2017. Doctoral Dissertation, University of Toronto. Accessed December 03, 2020. http://hdl.handle.net/1807/78955.

MLA Handbook (7^{th} Edition):

Erdem, Ozan. “Exploring a Two-Solver Architecture for Clause Learning CSP Solvers.” 2017. Web. 03 Dec 2020.

Vancouver:

Erdem O. Exploring a Two-Solver Architecture for Clause Learning CSP Solvers. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1807/78955.

Council of Science Editors:

Erdem O. Exploring a Two-Solver Architecture for Clause Learning CSP Solvers. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/78955

University of Illinois – Urbana-Champaign

11. Mai, Haohui. Diagnose network failures via data-plane analysis.

Degree: MS, 0112, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/18419

► Diagnosing problems in networks is a time-consuming and error-prone process. Previous tools to assist operators primarily focus on analyzing control plane configuration. Configuration analysis is…
(more)

Subjects/Keywords: Data-Plane Analysis; Network Failure; Satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Mai, H. (2011). Diagnose network failures via data-plane analysis. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18419

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mai, Haohui. “Diagnose network failures via data-plane analysis.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed December 03, 2020. http://hdl.handle.net/2142/18419.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mai, Haohui. “Diagnose network failures via data-plane analysis.” 2011. Web. 03 Dec 2020.

Vancouver:

Mai H. Diagnose network failures via data-plane analysis. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2142/18419.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mai H. Diagnose network failures via data-plane analysis. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18419

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

12.
Pisanov, Vladimir.
Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean * Satisfiability*.

Degree: 2012, University of Waterloo

URL: http://hdl.handle.net/10012/6941

► Boolean *Satisfiability* (SAT) is a fundamental NP-complete problem of determining whether there exists an assignment of variables which makes a Boolean formula evaluate to True.…
(more)

Subjects/Keywords: Boolean satisfiability; SAT; Backtracking search; Value ordering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pisanov, V. (2012). Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6941

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Pisanov, Vladimir. “Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability.” 2012. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/6941.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pisanov, Vladimir. “Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability.” 2012. Web. 03 Dec 2020.

Vancouver:

Pisanov V. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/6941.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pisanov V. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6941

Not specified: Masters Thesis or Doctoral Dissertation

13. Davies, Jessica. Solving MAXSAT by Decoupling Optimization and Satisfaction.

Degree: 2013, University of Toronto

URL: http://hdl.handle.net/1807/43539

►

Many problems that arise in the real world are difficult to solve partly because they present computational challenges. Many of these challenging problems are optimization… (more)

Subjects/Keywords: Combinatorial optimization; Propositional logic; Maximum satisfiability; Weighted constraints; Integer programming; Satisfiability; 0984; 0800; 0796

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Davies, J. (2013). Solving MAXSAT by Decoupling Optimization and Satisfaction. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/43539

Chicago Manual of Style (16^{th} Edition):

Davies, Jessica. “Solving MAXSAT by Decoupling Optimization and Satisfaction.” 2013. Doctoral Dissertation, University of Toronto. Accessed December 03, 2020. http://hdl.handle.net/1807/43539.

MLA Handbook (7^{th} Edition):

Davies, Jessica. “Solving MAXSAT by Decoupling Optimization and Satisfaction.” 2013. Web. 03 Dec 2020.

Vancouver:

Davies J. Solving MAXSAT by Decoupling Optimization and Satisfaction. [Internet] [Doctoral dissertation]. University of Toronto; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1807/43539.

Council of Science Editors:

Davies J. Solving MAXSAT by Decoupling Optimization and Satisfaction. [Doctoral Dissertation]. University of Toronto; 2013. Available from: http://hdl.handle.net/1807/43539

14. Al Rammahi, Raheem T. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT.

Degree: MS, Computer Science, 2016, U of Denver

URL: https://digitalcommons.du.edu/etd/1110

► Most of the companies in Iraq spend significant amounts of time and money when transferring employees between home and work. In this thesis, we…
(more)

Subjects/Keywords: CSP; Communicating sequential processes; MAX-SAT; Maximum satisfiability; Optimization; SAT; Boolean satisfiability; Computer Sciences

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Al Rammahi, R. T. (2016). Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT. (Thesis). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1110

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Al Rammahi, Raheem T. “Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT.” 2016. Thesis, U of Denver. Accessed December 03, 2020. https://digitalcommons.du.edu/etd/1110.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Al Rammahi, Raheem T. “Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT.” 2016. Web. 03 Dec 2020.

Vancouver:

Al Rammahi RT. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT. [Internet] [Thesis]. U of Denver; 2016. [cited 2020 Dec 03]. Available from: https://digitalcommons.du.edu/etd/1110.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Al Rammahi RT. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT. [Thesis]. U of Denver; 2016. Available from: https://digitalcommons.du.edu/etd/1110

Not specified: Masters Thesis or Doctoral Dissertation

15. Araújo, Rodrigo Farias. Um novo método de otimização baseado em teorias de satisfatibilidade.

Degree: 2017, Universidade Federal do Amazonas

URL: http://tede.ufam.edu.br/handle/tede/5715

►

Este trabalho apresenta um novo método de otimização aplicado a diferentes classes de problemas, como não-convexos e convexos. A metodologia consiste na utilização do contraexemplo… (more)

Subjects/Keywords: Otimização; Satisfabilidade; Teoria do Módulo de Satisfabilidade; Planejamento de caminho; Optimization; Satisfiability; Satisfiability Modulo Theory; Path planning; ENGENHARIAS: ENGENHARIA ELÉTRICA

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Araújo, R. F. (2017). Um novo método de otimização baseado em teorias de satisfatibilidade. (Masters Thesis). Universidade Federal do Amazonas. Retrieved from http://tede.ufam.edu.br/handle/tede/5715

Chicago Manual of Style (16^{th} Edition):

Araújo, Rodrigo Farias. “Um novo método de otimização baseado em teorias de satisfatibilidade.” 2017. Masters Thesis, Universidade Federal do Amazonas. Accessed December 03, 2020. http://tede.ufam.edu.br/handle/tede/5715.

MLA Handbook (7^{th} Edition):

Araújo, Rodrigo Farias. “Um novo método de otimização baseado em teorias de satisfatibilidade.” 2017. Web. 03 Dec 2020.

Vancouver:

Araújo RF. Um novo método de otimização baseado em teorias de satisfatibilidade. [Internet] [Masters thesis]. Universidade Federal do Amazonas; 2017. [cited 2020 Dec 03]. Available from: http://tede.ufam.edu.br/handle/tede/5715.

Council of Science Editors:

Araújo RF. Um novo método de otimização baseado em teorias de satisfatibilidade. [Masters Thesis]. Universidade Federal do Amazonas; 2017. Available from: http://tede.ufam.edu.br/handle/tede/5715

NSYSU

16. Hung, Chun-Chieh. Verifying Web Application Vulnerabilities by Model Checking.

Degree: Master, Information Management, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820109-230125

► Due to the continued development of Internet technology, more and more people are willing to take advantage of high-interaction and diverse web applications to deal…
(more)

Subjects/Keywords: Model Checking; SMT; Satisfiability Modulo Theories; Web application vulnerability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hung, C. (2009). Verifying Web Application Vulnerabilities by Model Checking. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820109-230125

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hung, Chun-Chieh. “Verifying Web Application Vulnerabilities by Model Checking.” 2009. Thesis, NSYSU. Accessed December 03, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820109-230125.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hung, Chun-Chieh. “Verifying Web Application Vulnerabilities by Model Checking.” 2009. Web. 03 Dec 2020.

Vancouver:

Hung C. Verifying Web Application Vulnerabilities by Model Checking. [Internet] [Thesis]. NSYSU; 2009. [cited 2020 Dec 03]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820109-230125.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hung C. Verifying Web Application Vulnerabilities by Model Checking. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0820109-230125

Not specified: Masters Thesis or Doctoral Dissertation

Universiteit Utrecht

17.
Sadowski, K.L.
GOMEA-SAT: Applying Gene-pool Optimal Mixing Evolutionary Algorithm for the Boolean *Satisfiability* Problem.

Degree: 2012, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/253756

► This paper explains the process of creating and optimizing GOMEA-SAT. It is a new Genetic Algorithm designed to solve the *Satisfiability* Problem in a fashion…
(more)

Subjects/Keywords: Genetic Algorithm; Satisfiability; SAT Problem; Evolution; Learning; Hybrid GA; GOMEA

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sadowski, K. L. (2012). GOMEA-SAT: Applying Gene-pool Optimal Mixing Evolutionary Algorithm for the Boolean Satisfiability Problem. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253756

Chicago Manual of Style (16^{th} Edition):

Sadowski, K L. “GOMEA-SAT: Applying Gene-pool Optimal Mixing Evolutionary Algorithm for the Boolean Satisfiability Problem.” 2012. Masters Thesis, Universiteit Utrecht. Accessed December 03, 2020. http://dspace.library.uu.nl:8080/handle/1874/253756.

MLA Handbook (7^{th} Edition):

Sadowski, K L. “GOMEA-SAT: Applying Gene-pool Optimal Mixing Evolutionary Algorithm for the Boolean Satisfiability Problem.” 2012. Web. 03 Dec 2020.

Vancouver:

Sadowski KL. GOMEA-SAT: Applying Gene-pool Optimal Mixing Evolutionary Algorithm for the Boolean Satisfiability Problem. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Dec 03]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253756.

Council of Science Editors:

Sadowski KL. GOMEA-SAT: Applying Gene-pool Optimal Mixing Evolutionary Algorithm for the Boolean Satisfiability Problem. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253756

Texas A&M University

18. Lin, Pey Chang K. Application of Logic Synthesis Toward the Inference and Control of Gene Regulatory Networks.

Degree: PhD, Electrical Engineering, 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151088

► In the quest to understand cell behavior and cure genetic diseases such as cancer, the fundamental approach being taken is undergoing a gradual change. It…
(more)

Subjects/Keywords: Genomics; Logic Synthesis; Boolean Satisfiability; Gene Regulatory Networks

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lin, P. C. K. (2013). Application of Logic Synthesis Toward the Inference and Control of Gene Regulatory Networks. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151088

Chicago Manual of Style (16^{th} Edition):

Lin, Pey Chang K. “Application of Logic Synthesis Toward the Inference and Control of Gene Regulatory Networks.” 2013. Doctoral Dissertation, Texas A&M University. Accessed December 03, 2020. http://hdl.handle.net/1969.1/151088.

MLA Handbook (7^{th} Edition):

Lin, Pey Chang K. “Application of Logic Synthesis Toward the Inference and Control of Gene Regulatory Networks.” 2013. Web. 03 Dec 2020.

Vancouver:

Lin PCK. Application of Logic Synthesis Toward the Inference and Control of Gene Regulatory Networks. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1969.1/151088.

Council of Science Editors:

Lin PCK. Application of Logic Synthesis Toward the Inference and Control of Gene Regulatory Networks. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151088

19. Sakho, Mouhamadou Tafsir. ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems.

Degree: Docteur es, Mathématiques-Informatique, 2014, Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal)

URL: http://www.theses.fr/2014ORLE2068

►

Un comportement distribué peut être décrit avec un multi-ensemble partiellement ordonné (pomset). Bien que compacts et très intuitifs, ces modèles sont difficiles à vérifier. La… (more)

Subjects/Keywords: Pomset; Model-checking; Satisfiabilité; Traces; Pomset; Model-checking; Satisfiability; Trace; 004.3

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sakho, M. T. (2014). ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems. (Doctoral Dissertation). Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal). Retrieved from http://www.theses.fr/2014ORLE2068

Chicago Manual of Style (16^{th} Edition):

Sakho, Mouhamadou Tafsir. “⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems.” 2014. Doctoral Dissertation, Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal). Accessed December 03, 2020. http://www.theses.fr/2014ORLE2068.

MLA Handbook (7^{th} Edition):

Sakho, Mouhamadou Tafsir. “⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems.” 2014. Web. 03 Dec 2020.

Vancouver:

Sakho MT. ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems. [Internet] [Doctoral dissertation]. Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal); 2014. [cited 2020 Dec 03]. Available from: http://www.theses.fr/2014ORLE2068.

Council of Science Editors:

Sakho MT. ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems. [Doctoral Dissertation]. Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal); 2014. Available from: http://www.theses.fr/2014ORLE2068

Iowa State University

20.
Jiang, Chuan.
Efficient *satisfiability* solver.

Degree: 2014, Iowa State University

URL: https://lib.dr.iastate.edu/etd/13869

► The past few decades saw great improvements in the performance of *satisfiability* (SAT) solvers. In this thesis, we discuss the state-of-the-art techniques used in building…
(more)

Subjects/Keywords: backtracking; conflict-driven clause learning; satisfiability; Computer Sciences

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jiang, C. (2014). Efficient satisfiability solver. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/13869

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Jiang, Chuan. “Efficient satisfiability solver.” 2014. Thesis, Iowa State University. Accessed December 03, 2020. https://lib.dr.iastate.edu/etd/13869.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jiang, Chuan. “Efficient satisfiability solver.” 2014. Web. 03 Dec 2020.

Vancouver:

Jiang C. Efficient satisfiability solver. [Internet] [Thesis]. Iowa State University; 2014. [cited 2020 Dec 03]. Available from: https://lib.dr.iastate.edu/etd/13869.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jiang C. Efficient satisfiability solver. [Thesis]. Iowa State University; 2014. Available from: https://lib.dr.iastate.edu/etd/13869

Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

21. Melinda Varga. Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>.

Degree: Physics, 2017, University of Notre Dame

URL: https://curate.nd.edu/show/0c483j35215

► There are many problems that cannot be solved with today’s digital computers. One of the most studied such problems is Boolean *satisfiability* (k-SAT), which…
(more)

Subjects/Keywords: constraint satisfaction problem; k-SAT; dynamical system; transient chaos; Boolean satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Varga, M. (2017). Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/0c483j35215

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Varga, Melinda. “Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>.” 2017. Thesis, University of Notre Dame. Accessed December 03, 2020. https://curate.nd.edu/show/0c483j35215.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Varga, Melinda. “Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>.” 2017. Web. 03 Dec 2020.

Vancouver:

Varga M. Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>. [Internet] [Thesis]. University of Notre Dame; 2017. [cited 2020 Dec 03]. Available from: https://curate.nd.edu/show/0c483j35215.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Varga M. Continuous-Time Dynamical Systems Approach to Hard Constraint Satisfaction Problems</h1>. [Thesis]. University of Notre Dame; 2017. Available from: https://curate.nd.edu/show/0c483j35215

Not specified: Masters Thesis or Doctoral Dissertation

22. Lotgering, T.F. (author). SDP-based Max-2-Sat Decomposition.

Degree: 2012, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:bfc3cd57-5713-4a47-a0e2-935887225d24

►

The Max-Sat problem has been intensively studied during the past few decades. Semi-definite programming based approximation algorithms provide good approximation ratios and polynomial runtime solutions… (more)

Subjects/Keywords: SDP; Maximum Satisfiability; Decomposition

…1
Introduction
The Boolean *satisfiability* problem, or SAT for short, is the problem of… …clauses are we then able to satisfy? This is called
the Maximum-*satisfiability* problem, or Max… …Introduction
*Satisfiability* problem is “NP-complete” which means that even though it is very simple… …Maximum-*Satisfiability*
problem is “NP-hard” meaning it is at least as hard.
There does exist an… …semidefinite programming relevant to solving maximum-*satisfiability*
problems compared to current…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lotgering, T. F. (. (2012). SDP-based Max-2-Sat Decomposition. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:bfc3cd57-5713-4a47-a0e2-935887225d24

Chicago Manual of Style (16^{th} Edition):

Lotgering, T F (author). “SDP-based Max-2-Sat Decomposition.” 2012. Masters Thesis, Delft University of Technology. Accessed December 03, 2020. http://resolver.tudelft.nl/uuid:bfc3cd57-5713-4a47-a0e2-935887225d24.

MLA Handbook (7^{th} Edition):

Lotgering, T F (author). “SDP-based Max-2-Sat Decomposition.” 2012. Web. 03 Dec 2020.

Vancouver:

Lotgering TF(. SDP-based Max-2-Sat Decomposition. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2020 Dec 03]. Available from: http://resolver.tudelft.nl/uuid:bfc3cd57-5713-4a47-a0e2-935887225d24.

Council of Science Editors:

Lotgering TF(. SDP-based Max-2-Sat Decomposition. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:bfc3cd57-5713-4a47-a0e2-935887225d24

Washington University in St. Louis

23. Huang, Ruoyun. Efficient Automated Planning with New Formulations.

Degree: PhD, Computer Science and Engineering, 2011, Washington University in St. Louis

URL: https://openscholarship.wustl.edu/etd/588

► Problem solving usually strongly relies on how the problem is formulated. This fact also applies to automated planning, a key field in artificial intelligence research.…
(more)

Subjects/Keywords: Computer Science; Computer Engineering; algorithm; constraints; encoding; Planning; Satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Huang, R. (2011). Efficient Automated Planning with New Formulations. (Doctoral Dissertation). Washington University in St. Louis. Retrieved from https://openscholarship.wustl.edu/etd/588

Chicago Manual of Style (16^{th} Edition):

Huang, Ruoyun. “Efficient Automated Planning with New Formulations.” 2011. Doctoral Dissertation, Washington University in St. Louis. Accessed December 03, 2020. https://openscholarship.wustl.edu/etd/588.

MLA Handbook (7^{th} Edition):

Huang, Ruoyun. “Efficient Automated Planning with New Formulations.” 2011. Web. 03 Dec 2020.

Vancouver:

Huang R. Efficient Automated Planning with New Formulations. [Internet] [Doctoral dissertation]. Washington University in St. Louis; 2011. [cited 2020 Dec 03]. Available from: https://openscholarship.wustl.edu/etd/588.

Council of Science Editors:

Huang R. Efficient Automated Planning with New Formulations. [Doctoral Dissertation]. Washington University in St. Louis; 2011. Available from: https://openscholarship.wustl.edu/etd/588

24. Wang, Kai. Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics.

Degree: 2015, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_graddiss/3479

► Ever-increasing amounts of complex biological data continue to come on line daily. Examples include proteomic, transcriptomic, genomic and metabolomic data generated by a plethora of…
(more)

Subjects/Keywords: differential coefficient of variation; differential entropy; paraclique; satisfiability; integer linear programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wang, K. (2015). Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/3479

Chicago Manual of Style (16^{th} Edition):

Wang, Kai. “Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics.” 2015. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed December 03, 2020. https://trace.tennessee.edu/utk_graddiss/3479.

MLA Handbook (7^{th} Edition):

Wang, Kai. “Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics.” 2015. Web. 03 Dec 2020.

Vancouver:

Wang K. Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2015. [cited 2020 Dec 03]. Available from: https://trace.tennessee.edu/utk_graddiss/3479.

Council of Science Editors:

Wang K. Analytical, Theoretical and Empirical Advances in Genome-Scale Algorithmics. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2015. Available from: https://trace.tennessee.edu/utk_graddiss/3479

University of Waterloo

25.
Salmon, Ricardo.
On the relationship between *satisfiability* and partially observable Markov decision processes.

Degree: 2018, University of Waterloo

URL: http://hdl.handle.net/10012/13951

► Stochastic *satisfiability* (SSAT), Quantified Boolean *Satisfiability* (QBF) and decision-theoretic planning in finite horizon partially observable Markov decision processes (POMDPs) are all PSPACE-Complete problems. Since they…
(more)

Subjects/Keywords: POMDP; Stochastic SAT; Satisfiability; Planning; Probabilistic Inference; SAT; QBF

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Salmon, R. (2018). On the relationship between satisfiability and partially observable Markov decision processes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13951

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Salmon, Ricardo. “On the relationship between satisfiability and partially observable Markov decision processes.” 2018. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/13951.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Salmon, Ricardo. “On the relationship between satisfiability and partially observable Markov decision processes.” 2018. Web. 03 Dec 2020.

Vancouver:

Salmon R. On the relationship between satisfiability and partially observable Markov decision processes. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/13951.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Salmon R. On the relationship between satisfiability and partially observable Markov decision processes. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13951

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

26. Newsham, Zackary. An Analysis of the Effect of Community Structure on SAT Solver Performance.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9110

► Despite enormous improvements in Boolean *SATisfiability* solver performance over the last decade, it is still unclear why specific input formula are slow to solve, when…
(more)

Subjects/Keywords: community; survival; SAT; solver; boolean satisfiability; linear regression

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Newsham, Z. (2015). An Analysis of the Effect of Community Structure on SAT Solver Performance. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9110

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Newsham, Zackary. “An Analysis of the Effect of Community Structure on SAT Solver Performance.” 2015. Thesis, University of Waterloo. Accessed December 03, 2020. http://hdl.handle.net/10012/9110.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Newsham, Zackary. “An Analysis of the Effect of Community Structure on SAT Solver Performance.” 2015. Web. 03 Dec 2020.

Vancouver:

Newsham Z. An Analysis of the Effect of Community Structure on SAT Solver Performance. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10012/9110.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Newsham Z. An Analysis of the Effect of Community Structure on SAT Solver Performance. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9110

Not specified: Masters Thesis or Doctoral Dissertation

University of Maryland

27. Mitchell, Joe Dan. Duality methods in networks, computer science models, and disordered condensed matter systems.

Degree: Physics, 2014, University of Maryland

URL: http://hdl.handle.net/1903/15829

► In this thesis, I explore lattice independent duality and systems to which it can be applied. I first demonstrate classical duality on models in an…
(more)

Subjects/Keywords: Condensed matter physics; Computer science; coulomb glass; duality; kramers wannier; satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Mitchell, J. D. (2014). Duality methods in networks, computer science models, and disordered condensed matter systems. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/15829

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mitchell, Joe Dan. “Duality methods in networks, computer science models, and disordered condensed matter systems.” 2014. Thesis, University of Maryland. Accessed December 03, 2020. http://hdl.handle.net/1903/15829.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mitchell, Joe Dan. “Duality methods in networks, computer science models, and disordered condensed matter systems.” 2014. Web. 03 Dec 2020.

Vancouver:

Mitchell JD. Duality methods in networks, computer science models, and disordered condensed matter systems. [Internet] [Thesis]. University of Maryland; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1903/15829.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mitchell JD. Duality methods in networks, computer science models, and disordered condensed matter systems. [Thesis]. University of Maryland; 2014. Available from: http://hdl.handle.net/1903/15829

Not specified: Masters Thesis or Doctoral Dissertation

Massey University

28.
Ren, Wei.
On the descriptive complexity of *satisfiability* on quantified Boolean formulas.

Degree: Master of Information Sciences, 2011, Massey University

URL: http://hdl.handle.net/10179/2629

► In the present thesis, we deal with the construction of non trivial formulas in higher order logic languages. In particular, we focus on using SO…
(more)

Subjects/Keywords: Boolean logic; Satisfiability problem; Computer algorithms; Logic languages

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ren, W. (2011). On the descriptive complexity of satisfiability on quantified Boolean formulas. (Masters Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/2629

Chicago Manual of Style (16^{th} Edition):

Ren, Wei. “On the descriptive complexity of satisfiability on quantified Boolean formulas.” 2011. Masters Thesis, Massey University. Accessed December 03, 2020. http://hdl.handle.net/10179/2629.

MLA Handbook (7^{th} Edition):

Ren, Wei. “On the descriptive complexity of satisfiability on quantified Boolean formulas.” 2011. Web. 03 Dec 2020.

Vancouver:

Ren W. On the descriptive complexity of satisfiability on quantified Boolean formulas. [Internet] [Masters thesis]. Massey University; 2011. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10179/2629.

Council of Science Editors:

Ren W. On the descriptive complexity of satisfiability on quantified Boolean formulas. [Masters Thesis]. Massey University; 2011. Available from: http://hdl.handle.net/10179/2629

29.
Sohanghpurwala, Ali Asgar Ali Akbar.
Exploits in Concurrency for Boolean * Satisfiability*.

Degree: PhD, Computer Engineering, 2018, Virginia Tech

URL: http://hdl.handle.net/10919/86417

► Boolean *Satisfiability* (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is…
(more)

Subjects/Keywords: Satisfiability; FPGA; SLS; MaxSAT; Parallel Local Search; SAT

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sohanghpurwala, A. A. A. A. (2018). Exploits in Concurrency for Boolean Satisfiability. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/86417

Chicago Manual of Style (16^{th} Edition):

Sohanghpurwala, Ali Asgar Ali Akbar. “Exploits in Concurrency for Boolean Satisfiability.” 2018. Doctoral Dissertation, Virginia Tech. Accessed December 03, 2020. http://hdl.handle.net/10919/86417.

MLA Handbook (7^{th} Edition):

Sohanghpurwala, Ali Asgar Ali Akbar. “Exploits in Concurrency for Boolean Satisfiability.” 2018. Web. 03 Dec 2020.

Vancouver:

Sohanghpurwala AAAA. Exploits in Concurrency for Boolean Satisfiability. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10919/86417.

Council of Science Editors:

Sohanghpurwala AAAA. Exploits in Concurrency for Boolean Satisfiability. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/86417

Virginia Tech

30.
Aytemiz, Tevfik.
A Probabilistic Study of 3-* SATISFIABILITY*.

Degree: PhD, Industrial and Systems Engineering, 2001, Virginia Tech

URL: http://hdl.handle.net/10919/28202

► Discrete optimization problems are defined by a finite set of solutions together with an objective function value assigned to each solution. Local search algorithms provide…
(more)

Subjects/Keywords: 3-Satisfiability; Satisfiability; Probabilistic Analysis of Max 3-Satisfiability; Tabu Search; Threshold Conjecture; Max 3-Satisfiability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Aytemiz, T. (2001). A Probabilistic Study of 3-SATISFIABILITY. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28202

Chicago Manual of Style (16^{th} Edition):

Aytemiz, Tevfik. “A Probabilistic Study of 3-SATISFIABILITY.” 2001. Doctoral Dissertation, Virginia Tech. Accessed December 03, 2020. http://hdl.handle.net/10919/28202.

MLA Handbook (7^{th} Edition):

Aytemiz, Tevfik. “A Probabilistic Study of 3-SATISFIABILITY.” 2001. Web. 03 Dec 2020.

Vancouver:

Aytemiz T. A Probabilistic Study of 3-SATISFIABILITY. [Internet] [Doctoral dissertation]. Virginia Tech; 2001. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10919/28202.

Council of Science Editors:

Aytemiz T. A Probabilistic Study of 3-SATISFIABILITY. [Doctoral Dissertation]. Virginia Tech; 2001. Available from: http://hdl.handle.net/10919/28202