Gotowa bibliografia na temat „Propositional satisfiability”
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”.
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"
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łaBordeaux, Lucas, Youssef Hamadi i Lintao Zhang. "Propositional Satisfiability and Constraint Programming". ACM Computing Surveys 38, nr 4 (25.12.2006): 12. http://dx.doi.org/10.1145/1177352.1177354.
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łaSideris, Andreas, i Yannis Dimopoulos. "Constraint Propagation in Propositional Planning". Proceedings of the International Conference on Automated Planning and Scheduling 20 (25.05.2021): 153–60. http://dx.doi.org/10.1609/icaps.v20i1.13422.
Pełny tekst źródłaLi, Jianwen, Kristin Y. Rozier, Geguang Pu, Yueling Zhang i Moshe Y. Vardi. "SAT-Based Explicit LTLf Satisfiability Checking". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17.07.2019): 2946–53. http://dx.doi.org/10.1609/aaai.v33i01.33012946.
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łaHalpern, J. Y., i R. Pucella. "A Logic for Reasoning about Upper Probabilities". Journal of Artificial Intelligence Research 17 (1.09.2002): 57–81. http://dx.doi.org/10.1613/jair.985.
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łaHamadi, Youssef, Saïd Jabbour i Lakhdar Saïs. "Learning from conflicts in propositional satisfiability". 4OR 10, nr 1 (28.12.2011): 15–32. http://dx.doi.org/10.1007/s10288-011-0191-7.
Pełny tekst źródłaTIAN, CONG, i ZHENHUA DUAN. "Complexity of propositional projection temporal logic with star". Mathematical Structures in Computer Science 19, nr 1 (luty 2009): 73–100. http://dx.doi.org/10.1017/s096012950800738x.
Pełny tekst źródłaRozprawy doktorskie na temat "Propositional satisfiability"
Al-Saedi, Mohammad Saleh Balasim. "Extensions of tractable classes for propositional satisfiability". Thesis, Artois, 2016. http://www.theses.fr/2016ARTO0405/document.
Pełny tekst źródłaKnowledge representation and reasoning is a key issue in computer science and more particularly in artificial intelligence. In this respect, propositional logic is a representation formalism that is a good trade-off between the opposite computational efficiency and expressiveness criteria. However, unless P = NP, deduction in propositional logic is not polynomial in the worst case. So, in this thesis we propose new extensions of tractable classes of the propositional satisfiability problem. Tractable fragments of SAT play a role in the implementation of the most efficient current SAT solvers, many of thesetractable classes use the linear time unit propagation (UP) inference rule. We attempt to extend two of currently-known polynomial fragments of SAT thanks to UP in such a way that the fragments can still be recognized and solved in polynomial time. A first result focuses on Quad fragments: we establish some properties of Quad fragments and extend these fragments and exhibit promising variants. The extension is obtained by allowing Quad fixed total orderings of clauses to be accompanied with specific additional separate orderings of maximal sub-clauses. The resulting fragments extend Quad without degrading its worst-case complexity. Also, we investigate how bounded resolution and redundancy through unit propagation can play a role in this respect. The second contribution on tractable subclasses of SAT concerns extensions of one well-known Tovey’s polynomial fragment so that they also include instances that can be simplified using UP. Then, we compare two existing polynomial fragments based on UP: namely, Quad and UP-Horn. We also answer an open question about the connections between these two classes: we show that UP-Horn and some other UP-based variants are strict subclasses of S Quad, where S Quad is the union of all Quad classes obtained by investigating all possible orderings of clauses
Hansen, Stephen Lee. "Complete Randomized Cutting Plane Algorithms for Propositional Satisfiability". NSUWorks, 2000. http://nsuworks.nova.edu/gscis_etd/565.
Pełny tekst źródłaDuong, 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
Ferreira, Junior Valnir, i N/A. "Improvements to Clause Weighting Local Search for Propositional Satisfiability". Griffith University. Institute for Integrated and Intelligent Systems, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070823.123257.
Pełny tekst źródłaPham, 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
Ferreira, Junior Valnir. "Improvements to Clause Weighting Local Search for Propositional Satisfiability". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365857.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
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łaIshtaiwi, 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
Książki na temat "Propositional satisfiability"
Harris, J. G. Approaches to the satisfiability problem of propositional logic. Manchester: UMIST, 1994.
Znajdź pełny tekst źródłaIntroduction to mathematics of satisfiability. Boca Raton: Taylor & Francis, 2009.
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łaSAT 2007 (2007 Lisbon, Portugal). Theory and applications of satisfiability testing: SAT 2007 : 10th international conference, Lisbon, Portugal, May 28-31, 2007 : proceedings. Berlin: Springer, 2007.
Znajdź pełny tekst źródłaH, Kleine Büning, i Zhao Xishun, red. Theory and applications of satisfiability testing--SAT 2008: 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008 : proceedings. Berlin: Springer, 2008.
Znajdź pełny tekst źródłaSAT 2010 (2010 Edinburgh, UK). Theory and applications of satisfiability testing-- SAT 2010: 13th international conference, SAT 2010 Edinburgh, UK, July 2010 : proceedings. Berlin: Springer, 2010.
Znajdź pełny tekst źródłaSakallah, Karem A. Theory and Applications of Satisfiability Testing - SAT 2011: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.
Znajdź pełny tekst źródłaTheodor, Lettman, red. Propositional logic: Deduction and algorithms. Cambridge [England]: Cambridge University Press, 1999.
Znajdź pełny tekst źródłaThomas, Schiex, red. Intelligence artificielle et informatique théorique. Toulouse: Cépaduès-éd., 1994.
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"
Sheini, Hossein M., i Karem A. Sakallah. "From Propositional Satisfiability to Satisfiability Modulo Theories". W Lecture Notes in Computer Science, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814948_1.
Pełny tekst źródłade 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ł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łaPelov, Nikolay, i Eugenia Ternovska. "Reducing Inductive Definitions to Propositional Satisfiability". W Logic Programming, 221–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11562931_18.
Pełny tekst źródłaEast, Deborah, i Mirosłlaw Truszczyński. "Propositional Satisfiability in Answer-Set Programming". W KI 2001: Advances in Artificial Intelligence, 138–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45422-5_11.
Pełny tekst źródłaMarques-Silva, João. "Algebraic Simplification Techniques for Propositional Satisfiability". W Principles and Practice of Constraint Programming – CP 2000, 537–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45349-0_45.
Pełny tekst źródłaVardi, Moshe Y. "Symbolic Techniques in Propositional Satisfiability Solving". W Lecture Notes in Computer Science, 2–3. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02777-2_2.
Pełny tekst źródłaBhalla, A., I. Lynce, J. T. de Sousa i J. Marques-Silva. "Heuristic-Based Backtracking for Propositional Satisfiability". W Progress in Artificial Intelligence, 116–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24580-3_19.
Pełny tekst źródłaWalsh, Toby. "Reformulating Propositional Satisfiability as Constraint Satisfaction". W Lecture Notes in Computer Science, 233–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44914-0_14.
Pełny tekst źródłaStreszczenia konferencji na temat "Propositional satisfiability"
HoonSang Jin i F. Somenzi. "Strong Conflict Analysis for Propositional Satisfiability". W 2006 Design, Automation and Test in Europe. IEEE, 2006. http://dx.doi.org/10.1109/date.2006.244149.
Pełny tekst źródłaMonnet, Anthony, i Roger Villemaire. "Scalable formula decomposition for propositional satisfiability". W the Third C* Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1822327.1822333.
Pełny tekst źródłaYujuan Zhao i Zhenming Song. "A new branching heuristic for propositional satisfiability". W 2016 International Conference on Fuzzy Theory and Its Applications (iFuzzy). IEEE, 2016. http://dx.doi.org/10.1109/ifuzzy.2016.8004924.
Pełny tekst źródłaNakamura, Kazuhiro, Shinji Maruoka, Shinji Kimura i Katsumasa Watanabe. "Multi-clock path analysis using propositional satisfiability". W the 2000 conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/368434.368533.
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łaJensen, Richard, Andrew Tuson i Qiang Shen. "Extending propositional satisfiability to determine minimal fuzzy-rough reducts". W 2010 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2010. http://dx.doi.org/10.1109/fuzzy.2010.5584470.
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ł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łaSurynek, Pavel. "Mutex reasoning in cooperative path finding modeled as propositional satisfiability". W 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013). IEEE, 2013. http://dx.doi.org/10.1109/iros.2013.6696977.
Pełny tekst źródłaJabbour, Said, Nizar Mhadbhi, Badran Raddaoui i Lakhdar Sais. "Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability". W 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2018. http://dx.doi.org/10.1109/aina.2018.00072.
Pełny tekst źródłaRaporty organizacyjne na temat "Propositional satisfiability"
Lutz, Carsten, i Dirk Walther. PDL with Negation of Atomic Programs. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.129.
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, Stefan Borgwardt i Barbara Morawska. SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.186.
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łaBaader, Franz, i Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.
Pełny tekst źródłaBaader, 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ła