Gotowa bibliografia na temat „Propositional satisfiability problems”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Propositional satisfiability problems”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Propositional satisfiability problems"
Jeroslow, Robert G., i Jinchang Wang. "Solving propositional satisfiability problems". Annals of Mathematics and Artificial Intelligence 1, nr 1-4 (wrzesień 1990): 167–87. http://dx.doi.org/10.1007/bf01531077.
Pełny tekst źródłaMEIER, ARNE, MICHAEL THOMAS, HERIBERT VOLLMER i MARTIN MUNDHENK. "THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆". International Journal of Foundations of Computer Science 20, nr 05 (październik 2009): 901–18. http://dx.doi.org/10.1142/s0129054109006954.
Pełny tekst źródłaMOUHOUB, MALEK, i SAMIRA SADAOUI. "SOLVING INCREMENTAL SATISFIABILITY". International Journal on Artificial Intelligence Tools 16, nr 01 (luty 2007): 139–47. http://dx.doi.org/10.1142/s0218213007003254.
Pełny tekst źródłaAravantinos, V., R. Caferra i N. Peltier. "Decidability and Undecidability Results for Propositional Schemata". Journal of Artificial Intelligence Research 40 (22.03.2011): 599–656. http://dx.doi.org/10.1613/jair.3351.
Pełny tekst źródłaCameron, Chris, Rex Chen, Jason Hartford i Kevin Leyton-Brown. "Predicting Propositional Satisfiability via End-to-End Learning". Proceedings of the AAAI Conference on Artificial Intelligence 34, nr 04 (3.04.2020): 3324–31. http://dx.doi.org/10.1609/aaai.v34i04.5733.
Pełny tekst źródłaReith, Steffen, i Heribert Vollmer. "Optimal satisfiability for propositional calculi and constraint satisfaction problems". Information and Computation 186, nr 1 (październik 2003): 1–19. http://dx.doi.org/10.1016/s0890-5401(03)00092-0.
Pełny tekst źródłaMOUHOUB, MALEK. "SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT". International Journal of Computational Intelligence and Applications 07, nr 01 (marzec 2008): 77–96. http://dx.doi.org/10.1142/s1469026808002193.
Pełny tekst źródłaBalu, Radhakrishnan, Dale Shires i Raju Namburu. "A quantum algorithm for uniform sampling of models of propositional logic based on quantum probability". Journal of Defense Modeling and Simulation: Applications, Methodology, Technology 16, nr 1 (17.05.2016): 57–65. http://dx.doi.org/10.1177/1548512916648232.
Pełny tekst źródłaPinkas, Gadi. "Symmetric Neural Networks and Propositional Logic Satisfiability". Neural Computation 3, nr 2 (czerwiec 1991): 282–91. http://dx.doi.org/10.1162/neco.1991.3.2.282.
Pełny tekst źródłaBoudane, Abdelhamid, Saïd Jabbour, Lakhdar Sais i Yakoub Salhi. "SAT-Based Data Mining". International Journal on Artificial Intelligence Tools 27, nr 01 (luty 2018): 1840002. http://dx.doi.org/10.1142/s021821301840002x.
Pełny tekst źródłaRozprawy doktorskie na temat "Propositional satisfiability problems"
Pham, Duc Nghia, i n/a. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Griffith University. Institute for Integrated and Intelligent Systems, 2006. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070216.143447.
Pełny tekst źródłaPham, Duc Nghia. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Thesis, Griffith University, 2006. http://hdl.handle.net/10072/365503.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Duong, Thach-Thao Nguyen. "Improving Diversification in Local Search for Propositional Satisfiability". Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365717.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
Ishtaiwi, Abdelraouf. "Towards Effective Parameter-Free Clause Weighting Local Search for SAT". Thesis, Griffith University, 2008. http://hdl.handle.net/10072/366980.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Faculty of Engineering and Information Technology
Full Text
Slater, Andrew, i andrew slater@csl anu edu au. "Investigations into Satisfiability Search". The Australian National University. Research School of Information Sciences and Engineering, 2003. http://thesis.anu.edu.au./public/adt-ANU20040310.103258.
Pełny tekst źródłaDrake, Lyndon Paul. "Combining inference and backtracking search for the propositional satisfiability problem". Thesis, University of York, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.421496.
Pełny tekst źródłaSlater, Andrew. "Investigations into Satisfiability Search". Phd thesis, 2004. http://hdl.handle.net/1885/48193.
Pełny tekst źródła"A solution scheme of satisfiability problem by active usage of totally unimodularity property". 2003. http://library.cuhk.edu.hk/record=b5896100.
Pełny tekst źródłaThesis (M.Phil.)--Chinese University of Hong Kong, 2003.
Includes bibliographical references (leaves 93-98).
Abstracts in English and Chinese.
Table of Contents --- p.v
Abstract --- p.viii
Acknowledgements --- p.x
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Satisfiability Problem --- p.1
Chapter 1.2 --- Motivation of the Research --- p.1
Chapter 1.3 --- Overview of the Thesis --- p.2
Chapter 2 --- Satisfiability Problem --- p.4
Chapter 2.1 --- Satisfiability Problem --- p.5
Chapter 2.1.1 --- Basic Definition --- p.5
Chapter 2.1.2 --- Phase Transitions --- p.5
Chapter 2.2 --- History --- p.6
Chapter 2.3 --- The Basic Search Algorithm --- p.8
Chapter 2.4 --- Some Improvements to the Basic Algorithm --- p.9
Chapter 2.4.1 --- Satz by Chu-Min Li --- p.9
Chapter 2.4.2 --- Heuristics and Local Search --- p.12
Chapter 2.4.3 --- Relaxation --- p.13
Chapter 2.5 --- Benchmarks --- p.14
Chapter 2.5.1 --- Specific Problems --- p.14
Chapter 2.5.2 --- Randomly Generated Problems --- p.14
Chapter 2.6 --- Software and Internet Information for SAT solving --- p.16
Chapter 2.6.1 --- Stochastic Local Search Algorithms (incomplete) --- p.16
Chapter 2.6.2 --- Systematic Search Algorithms (complete) --- p.16
Chapter 2.6.3 --- Some useful Links to SAT Related Sites --- p.17
Chapter 3 --- Integer Programming Formulation for Logic Problem --- p.18
Chapter 3.1 --- SAT Problem --- p.19
Chapter 3.2 --- MAXSAT Problem --- p.19
Chapter 3.3 --- Logical Inference Problem --- p.19
Chapter 3.4 --- Weighted Exact Satisfiability Problem --- p.20
Chapter 4 --- Integer Programming Formulation for SAT Problem --- p.22
Chapter 4.1 --- From 3-CNF SAT Clauses to Zero-One IP Constraints --- p.22
Chapter 4.2 --- Integer Programming Model for 3-SAT --- p.23
Chapter 4.3 --- The Equivalence of the SAT and the IP --- p.23
Chapter 4.4 --- Example --- p.24
Chapter 5 --- Integer Solvability of Linear Programs --- p.27
Chapter 5.1 --- Unimodularity --- p.27
Chapter 5.2 --- Totally Unimodularity --- p.28
Chapter 5.3 --- Some Results on Recognition of Linear Solvability of IP --- p.32
Chapter 6 --- TU Based Matrix Research Results --- p.33
Chapter 6.1 --- 2x2 Matrix's TU Property --- p.33
Chapter 6.2 --- Extended Integer Programming Model for SAT --- p.34
Chapter 6.3 --- 3x3 Matrix's TU Property --- p.35
Chapter 7 --- Totally Unimodularity Based Branching-and-Bound Algorithm --- p.38
Chapter 7.1 --- Introduction --- p.38
Chapter 7.1.1 --- Enumeration Trees --- p.39
Chapter 7.1.2 --- The Concept of Branch and Bound --- p.42
Chapter 7.2 --- TU Based Branching Rule --- p.43
Chapter 7.2.1 --- How to sort variables based on 2x2 submatrices --- p.43
Chapter 7.2.2 --- How to sort the rest variables --- p.45
Chapter 7.3 --- TU Based Bounding Rule --- p.46
Chapter 7.4 --- TU Based Branch-and-Bound Algorithm --- p.47
Chapter 7.5 --- Example --- p.49
Chapter 8 --- Numerical Result --- p.57
Chapter 8.1 --- Experimental Result --- p.57
Chapter 8.2 --- Statistical Results of ILOG CPLEX --- p.59
Chapter 9 --- Conclusions --- p.61
Chapter 9.1 --- Contributions --- p.61
Chapter 9.2 --- Future Work --- p.62
Chapter A --- The Coefficient Matrix A for Example in Chapter 7 --- p.64
Chapter B --- The Detailed Numerical Information of Solution Process for Exam- ple in Chapter 7 --- p.66
Chapter C --- Experimental Result --- p.67
Chapter C.1 --- "# of variables: 20, # of clauses: 91" --- p.67
Chapter C.2 --- "# of variables: 50, # of clauses: 218" --- p.70
Chapter C.3 --- # of variables: 75,# of clauses: 325 --- p.73
Chapter C.4 --- "# of variables: 100, # of clauses: 430" --- p.76
Chapter D --- Experimental Result of ILOG CPLEX --- p.80
Chapter D.1 --- # of variables: 20´ة # of clauses: 91 --- p.80
Chapter D.2 --- # of variables: 50,#of clauses: 218 --- p.83
Chapter D.3 --- # of variables: 75,# of clauses: 325 --- p.86
Chapter D.4 --- "# of variables: 100, # of clauses: 430" --- p.89
Bibliography --- p.93
Χαρατσάρης, Δημήτριος. "Υλοποίηση διαδικτυακού προσομοιωτή για αλγορίθμους επίλυσης προβλημάτων SAT". Thesis, 2012. http://hdl.handle.net/10889/5754.
Pełny tekst źródłaThis diploma dissertation deals with SAT solvers, algorithms for the Boolean satisfiability problem. It was produced in the Wire Communications Laboratory of the Electrical and Computer Engineering Department of the University of Patras. Its aim is to create a simulator for these algorithms, accessible to anyone via the Internet. An introduction to the field of Artificial Intelligence and more specifically to Propositional Calculus was given as well as the necessary groundwork to understand the problem and its solution approaches. The simulation implementation was developed in Java
Książki na temat "Propositional satisfiability problems"
Harris, J. G. Approaches to the satisfiability problem of propositional logic. Manchester: UMIST, 1994.
Znajdź pełny tekst źródłaDingzhu, Du, Gu Jun 1956-, Pardalos P. M. 1954- i NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science., red. Satisfiability problem: Theory and applications : DIMACS workshop, March 11-13, 1996. Providence, R.I: American Mathematical Society, 1997.
Znajdź pełny tekst źródłavan, Dieter Melkebeek. A Survey of Lower Bounds for Satisfiability and Related Problems. Now Publishers Inc, 2007.
Znajdź pełny tekst źródłaThe satisfiability problem. Amsterdam: Elsevier, 1999.
Znajdź pełny tekst źródłaCzęści książek na temat "Propositional satisfiability problems"
de Haan, Ronald. "Problems Related to Propositional Satisfiability". W Parameterized Complexity in the Polynomial Hierarchy, 205–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-60670-4_10.
Pełny tekst źródłaGraça, Ana, João Marques-Silva i Inês Lynce. "Haplotype Inference Using Propositional Satisfiability". W Mathematical Approaches to Polymer Sequence Analysis and Related Problems, 127–47. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-6800-5_7.
Pełny tekst źródłaReith, Steffen, i Heribert Vollmer. "Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems". W Lecture Notes in Computer Science, 640–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44612-5_59.
Pełny tekst źródłaGuller, Dušan. "On the Satisfiability and Validity Problems in the Propositional Gödel Logic". W Studies in Computational Intelligence, 211–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27534-0_14.
Pełny tekst źródłaTang, Daijue, Yinlei Yu, Darsh Ranjan i Sharad Malik. "Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems". W Theory and Applications of Satisfiability Testing, 292–305. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11527695_23.
Pełny tekst źródłaWang, Jinchang. "Branching rules for propositional satisfiability test". W Satisfiability Problem: Theory and Applications, 351–64. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/09.
Pełny tekst źródłaPlaisted, Daivd, i Geoffrey Alexander. "Propositional search efficiency and first-order theorem proving". W Satisfiability Problem: Theory and Applications, 335–50. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/08.
Pełny tekst źródłaAravantinos, Vincent, Ricardo Caferra i Nicolas Peltier. "Complexity of the Satisfiability Problem for a Class of Propositional Schemata". W Language and Automata Theory and Applications, 58–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13089-2_5.
Pełny tekst źródłaArvind, V., i S. Biswas. "On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas". W Lecture Notes in Computer Science, 456–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18625-5_68.
Pełny tekst źródłaSanders, Peter, i Dominik Schreiber. "Decentralized Online Scheduling of Malleable NP-hard Jobs". W Euro-Par 2022: Parallel Processing, 119–35. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12597-3_8.
Pełny tekst źródłaStreszczenia konferencji na temat "Propositional satisfiability problems"
Ignatiev, Alexey, Antonio Morgado i Joao Marques-Silva. "Cardinality Encodings for Graph Optimization Problems". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/91.
Pełny tekst źródłaCaleiro, Carlos, Filipe Casal i Andreia Mordido. "Classical Generalized Probabilistic Satisfiability". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/126.
Pełny tekst źródłaLee, Nian-Ze, Yen-Shi Wang i Jie-Hong R. Jiang. "Solving Stochastic Boolean Satisfiability under Random-Exist Quantification". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/96.
Pełny tekst źródłaCordeiro, Lucas C. "Exploiting the SAT Revolution for Automated Software Verification: Report from an Industrial Case Study". W Anais Estendidos do Latin-American Symposium on Dependable Computing. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ladc.2021.18531.
Pełny tekst źródłaKolb, Samuel, Stefano Teso, Andrea Passerini i Luc De Raedt. "Learning SMT(LRA) Constraints using SMT Solvers". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/323.
Pełny tekst źródłaGrossi, Davide, Emiliano Lorini i François Schwarzentruber. "The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/710.
Pełny tekst źródłaZou, Li, i Wenjiang Li. "Satisfiability Problem of Linguistic Truth-Valued Intuitionistic Propositional Logic". W 2008 3rd International Conference on Innovative Computing Information and Control. IEEE, 2008. http://dx.doi.org/10.1109/icicic.2008.485.
Pełny tekst źródłaHerzig, Andreas, Frédéric Maris i Julien Vianey. "Dynamic logic of parallel propositional assignments and its applications to planning". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/774.
Pełny tekst źródłaLiang, Jiaxin, Feifei Ma, Junping Zhou i Minghao Yin. "AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/259.
Pełny tekst źródłaGeatti, Luca, Alessandro Gianola i Nicola Gigante. "Linear Temporal Logic Modulo Theories over Finite Traces". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/366.
Pełny tekst źródłaRaporty organizacyjne na temat "Propositional satisfiability problems"
Baader, Franz, i Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
Pełny tekst źródłaBorgwardt, Stefan, Marcel Lippmann i Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.
Pełny tekst źródłaBaader, Franz, Pavlos Marantidis i Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.
Pełny tekst źródła