Academic literature on the topic 'Propositional satisfiability'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Propositional satisfiability.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Propositional satisfiability"
Jeroslow, Robert G., and Jinchang Wang. "Solving propositional satisfiability problems." Annals of Mathematics and Artificial Intelligence 1, no. 1-4 (September 1990): 167–87. http://dx.doi.org/10.1007/bf01531077.
Full textBordeaux, Lucas, Youssef Hamadi, and Lintao Zhang. "Propositional Satisfiability and Constraint Programming." ACM Computing Surveys 38, no. 4 (December 25, 2006): 12. http://dx.doi.org/10.1145/1177352.1177354.
Full textAravantinos, V., R. Caferra, and N. Peltier. "Decidability and Undecidability Results for Propositional Schemata." Journal of Artificial Intelligence Research 40 (March 22, 2011): 599–656. http://dx.doi.org/10.1613/jair.3351.
Full textSideris, Andreas, and Yannis Dimopoulos. "Constraint Propagation in Propositional Planning." Proceedings of the International Conference on Automated Planning and Scheduling 20 (May 25, 2021): 153–60. http://dx.doi.org/10.1609/icaps.v20i1.13422.
Full textLi, Jianwen, Kristin Y. Rozier, Geguang Pu, Yueling Zhang, and Moshe Y. Vardi. "SAT-Based Explicit LTLf Satisfiability Checking." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2946–53. http://dx.doi.org/10.1609/aaai.v33i01.33012946.
Full textMEIER, ARNE, MICHAEL THOMAS, HERIBERT VOLLMER, and MARTIN MUNDHENK. "THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆." International Journal of Foundations of Computer Science 20, no. 05 (October 2009): 901–18. http://dx.doi.org/10.1142/s0129054109006954.
Full textHalpern, J. Y., and R. Pucella. "A Logic for Reasoning about Upper Probabilities." Journal of Artificial Intelligence Research 17 (September 1, 2002): 57–81. http://dx.doi.org/10.1613/jair.985.
Full textMOUHOUB, MALEK, and SAMIRA SADAOUI. "SOLVING INCREMENTAL SATISFIABILITY." International Journal on Artificial Intelligence Tools 16, no. 01 (February 2007): 139–47. http://dx.doi.org/10.1142/s0218213007003254.
Full textHamadi, Youssef, Saïd Jabbour, and Lakhdar Saïs. "Learning from conflicts in propositional satisfiability." 4OR 10, no. 1 (December 28, 2011): 15–32. http://dx.doi.org/10.1007/s10288-011-0191-7.
Full textTIAN, CONG, and ZHENHUA DUAN. "Complexity of propositional projection temporal logic with star." Mathematical Structures in Computer Science 19, no. 1 (February 2009): 73–100. http://dx.doi.org/10.1017/s096012950800738x.
Full textDissertations / Theses on the topic "Propositional satisfiability"
Al-Saedi, Mohammad Saleh Balasim. "Extensions of tractable classes for propositional satisfiability." Thesis, Artois, 2016. http://www.theses.fr/2016ARTO0405/document.
Full textKnowledge 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.
Full textDuong, Thach-Thao Nguyen. "Improving Diversification in Local Search for Propositional Satisfiability." Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365717.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
Ferreira, Junior Valnir, and 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.
Full textPham, Duc Nghia, and 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.
Full textPham, Duc Nghia. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems." Thesis, Griffith University, 2006. http://hdl.handle.net/10072/365503.
Full textThesis (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.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Slater, Andrew, and 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.
Full textDrake, 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.
Full textIshtaiwi, Abdelraouf. "Towards Effective Parameter-Free Clause Weighting Local Search for SAT." Thesis, Griffith University, 2008. http://hdl.handle.net/10072/366980.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Faculty of Engineering and Information Technology
Full Text
Books on the topic "Propositional satisfiability"
Harris, J. G. Approaches to the satisfiability problem of propositional logic. Manchester: UMIST, 1994.
Find full textIntroduction to mathematics of satisfiability. Boca Raton: Taylor & Francis, 2009.
Find full textDingzhu, Du, Gu Jun 1956-, Pardalos P. M. 1954-, and NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science., eds. Satisfiability problem: Theory and applications : DIMACS workshop, March 11-13, 1996. Providence, R.I: American Mathematical Society, 1997.
Find full textSAT 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.
Find full textH, Kleine Büning, and Zhao Xishun, eds. Theory and applications of satisfiability testing--SAT 2008: 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008 : proceedings. Berlin: Springer, 2008.
Find full textSAT 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.
Find full textSakallah, 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.
Find full textTheodor, Lettman, ed. Propositional logic: Deduction and algorithms. Cambridge [England]: Cambridge University Press, 1999.
Find full textThomas, Schiex, ed. Intelligence artificielle et informatique théorique. Toulouse: Cépaduès-éd., 1994.
Find full textThe satisfiability problem. Amsterdam: Elsevier, 1999.
Find full textBook chapters on the topic "Propositional satisfiability"
Sheini, Hossein M., and Karem A. Sakallah. "From Propositional Satisfiability to Satisfiability Modulo Theories." In Lecture Notes in Computer Science, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814948_1.
Full textde Haan, Ronald. "Problems Related to Propositional Satisfiability." In 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.
Full textGraça, Ana, João Marques-Silva, and Inês Lynce. "Haplotype Inference Using Propositional Satisfiability." In 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.
Full textWang, Jinchang. "Branching rules for propositional satisfiability test." In Satisfiability Problem: Theory and Applications, 351–64. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/09.
Full textPelov, Nikolay, and Eugenia Ternovska. "Reducing Inductive Definitions to Propositional Satisfiability." In Logic Programming, 221–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11562931_18.
Full textEast, Deborah, and Mirosłlaw Truszczyński. "Propositional Satisfiability in Answer-Set Programming." In 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.
Full textMarques-Silva, João. "Algebraic Simplification Techniques for Propositional Satisfiability." In 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.
Full textVardi, Moshe Y. "Symbolic Techniques in Propositional Satisfiability Solving." In 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.
Full textBhalla, A., I. Lynce, J. T. de Sousa, and J. Marques-Silva. "Heuristic-Based Backtracking for Propositional Satisfiability." In Progress in Artificial Intelligence, 116–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24580-3_19.
Full textWalsh, Toby. "Reformulating Propositional Satisfiability as Constraint Satisfaction." In Lecture Notes in Computer Science, 233–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44914-0_14.
Full textConference papers on the topic "Propositional satisfiability"
HoonSang Jin and F. Somenzi. "Strong Conflict Analysis for Propositional Satisfiability." In 2006 Design, Automation and Test in Europe. IEEE, 2006. http://dx.doi.org/10.1109/date.2006.244149.
Full textMonnet, Anthony, and Roger Villemaire. "Scalable formula decomposition for propositional satisfiability." In the Third C* Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1822327.1822333.
Full textYujuan Zhao and Zhenming Song. "A new branching heuristic for propositional satisfiability." In 2016 International Conference on Fuzzy Theory and Its Applications (iFuzzy). IEEE, 2016. http://dx.doi.org/10.1109/ifuzzy.2016.8004924.
Full textNakamura, Kazuhiro, Shinji Maruoka, Shinji Kimura, and Katsumasa Watanabe. "Multi-clock path analysis using propositional satisfiability." In the 2000 conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/368434.368533.
Full textGrossi, Davide, Emiliano Lorini, and François Schwarzentruber. "The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)." In 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.
Full textJensen, Richard, Andrew Tuson, and Qiang Shen. "Extending propositional satisfiability to determine minimal fuzzy-rough reducts." In 2010 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2010. http://dx.doi.org/10.1109/fuzzy.2010.5584470.
Full textZou, Li, and Wenjiang Li. "Satisfiability Problem of Linguistic Truth-Valued Intuitionistic Propositional Logic." In 2008 3rd International Conference on Innovative Computing Information and Control. IEEE, 2008. http://dx.doi.org/10.1109/icicic.2008.485.
Full textCaleiro, Carlos, Filipe Casal, and Andreia Mordido. "Classical Generalized Probabilistic Satisfiability." In 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.
Full textSurynek, Pavel. "Mutex reasoning in cooperative path finding modeled as propositional satisfiability." In 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013). IEEE, 2013. http://dx.doi.org/10.1109/iros.2013.6696977.
Full textJabbour, Said, Nizar Mhadbhi, Badran Raddaoui, and Lakhdar Sais. "Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability." In 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2018. http://dx.doi.org/10.1109/aina.2018.00072.
Full textReports on the topic "Propositional satisfiability"
Lutz, Carsten, and Dirk Walther. PDL with Negation of Atomic Programs. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.129.
Full textBorgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.
Full textBaader, Franz, Stefan Borgwardt, and 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.
Full textBaader, Franz, Pavlos Marantidis, and Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.
Full textBaader, Franz, and Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.
Full textBaader, Franz, and Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
Full text