Literatura académica sobre el tema "Propositional satisfiability"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Propositional satisfiability".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Propositional satisfiability"
Jeroslow, Robert G. y Jinchang Wang. "Solving propositional satisfiability problems". Annals of Mathematics and Artificial Intelligence 1, n.º 1-4 (septiembre de 1990): 167–87. http://dx.doi.org/10.1007/bf01531077.
Texto completoBordeaux, Lucas, Youssef Hamadi y Lintao Zhang. "Propositional Satisfiability and Constraint Programming". ACM Computing Surveys 38, n.º 4 (25 de diciembre de 2006): 12. http://dx.doi.org/10.1145/1177352.1177354.
Texto completoAravantinos, V., R. Caferra y N. Peltier. "Decidability and Undecidability Results for Propositional Schemata". Journal of Artificial Intelligence Research 40 (22 de marzo de 2011): 599–656. http://dx.doi.org/10.1613/jair.3351.
Texto completoSideris, Andreas y Yannis Dimopoulos. "Constraint Propagation in Propositional Planning". Proceedings of the International Conference on Automated Planning and Scheduling 20 (25 de mayo de 2021): 153–60. http://dx.doi.org/10.1609/icaps.v20i1.13422.
Texto completoLi, Jianwen, Kristin Y. Rozier, Geguang Pu, Yueling Zhang y Moshe Y. Vardi. "SAT-Based Explicit LTLf Satisfiability Checking". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 2946–53. http://dx.doi.org/10.1609/aaai.v33i01.33012946.
Texto completoMEIER, ARNE, MICHAEL THOMAS, HERIBERT VOLLMER y MARTIN MUNDHENK. "THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆". International Journal of Foundations of Computer Science 20, n.º 05 (octubre de 2009): 901–18. http://dx.doi.org/10.1142/s0129054109006954.
Texto completoHalpern, J. Y. y R. Pucella. "A Logic for Reasoning about Upper Probabilities". Journal of Artificial Intelligence Research 17 (1 de septiembre de 2002): 57–81. http://dx.doi.org/10.1613/jair.985.
Texto completoMOUHOUB, MALEK y SAMIRA SADAOUI. "SOLVING INCREMENTAL SATISFIABILITY". International Journal on Artificial Intelligence Tools 16, n.º 01 (febrero de 2007): 139–47. http://dx.doi.org/10.1142/s0218213007003254.
Texto completoHamadi, Youssef, Saïd Jabbour y Lakhdar Saïs. "Learning from conflicts in propositional satisfiability". 4OR 10, n.º 1 (28 de diciembre de 2011): 15–32. http://dx.doi.org/10.1007/s10288-011-0191-7.
Texto completoTIAN, CONG y ZHENHUA DUAN. "Complexity of propositional projection temporal logic with star". Mathematical Structures in Computer Science 19, n.º 1 (febrero de 2009): 73–100. http://dx.doi.org/10.1017/s096012950800738x.
Texto completoTesis sobre el tema "Propositional satisfiability"
Al-Saedi, Mohammad Saleh Balasim. "Extensions of tractable classes for propositional satisfiability". Thesis, Artois, 2016. http://www.theses.fr/2016ARTO0405/document.
Texto completoKnowledge 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.
Texto completoDuong, Thach-Thao Nguyen. "Improving Diversification in Local Search for Propositional Satisfiability". Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365717.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
Ferreira, Junior Valnir y 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.
Texto completoPham, Duc Nghia y 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.
Texto completoPham, Duc Nghia. "Modelling and Exploiting Structures in Solving Propositional Satisfiability Problems". Thesis, Griffith University, 2006. http://hdl.handle.net/10072/365503.
Texto completoThesis (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.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Slater, Andrew y 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.
Texto completoDrake, 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.
Texto completoIshtaiwi, Abdelraouf. "Towards Effective Parameter-Free Clause Weighting Local Search for SAT". Thesis, Griffith University, 2008. http://hdl.handle.net/10072/366980.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Faculty of Engineering and Information Technology
Full Text
Libros sobre el tema "Propositional satisfiability"
Harris, J. G. Approaches to the satisfiability problem of propositional logic. Manchester: UMIST, 1994.
Buscar texto completoIntroduction to mathematics of satisfiability. Boca Raton: Taylor & Francis, 2009.
Buscar texto completoDingzhu, Du, Gu Jun 1956-, Pardalos P. M. 1954- y 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.
Buscar texto completoSAT 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.
Buscar texto completoH, Kleine Büning y 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.
Buscar texto completoSAT 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.
Buscar texto completoSakallah, 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.
Buscar texto completoTheodor, Lettman, ed. Propositional logic: Deduction and algorithms. Cambridge [England]: Cambridge University Press, 1999.
Buscar texto completoThomas, Schiex, ed. Intelligence artificielle et informatique théorique. Toulouse: Cépaduès-éd., 1994.
Buscar texto completoThe satisfiability problem. Amsterdam: Elsevier, 1999.
Buscar texto completoCapítulos de libros sobre el tema "Propositional satisfiability"
Sheini, Hossein M. y Karem A. Sakallah. "From Propositional Satisfiability to Satisfiability Modulo Theories". En Lecture Notes in Computer Science, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814948_1.
Texto completode Haan, Ronald. "Problems Related to Propositional Satisfiability". En 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.
Texto completoGraça, Ana, João Marques-Silva y Inês Lynce. "Haplotype Inference Using Propositional Satisfiability". En 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.
Texto completoWang, Jinchang. "Branching rules for propositional satisfiability test". En Satisfiability Problem: Theory and Applications, 351–64. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/035/09.
Texto completoPelov, Nikolay y Eugenia Ternovska. "Reducing Inductive Definitions to Propositional Satisfiability". En Logic Programming, 221–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11562931_18.
Texto completoEast, Deborah y Mirosłlaw Truszczyński. "Propositional Satisfiability in Answer-Set Programming". En 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.
Texto completoMarques-Silva, João. "Algebraic Simplification Techniques for Propositional Satisfiability". En 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.
Texto completoVardi, Moshe Y. "Symbolic Techniques in Propositional Satisfiability Solving". En 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.
Texto completoBhalla, A., I. Lynce, J. T. de Sousa y J. Marques-Silva. "Heuristic-Based Backtracking for Propositional Satisfiability". En Progress in Artificial Intelligence, 116–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24580-3_19.
Texto completoWalsh, Toby. "Reformulating Propositional Satisfiability as Constraint Satisfaction". En Lecture Notes in Computer Science, 233–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44914-0_14.
Texto completoActas de conferencias sobre el tema "Propositional satisfiability"
HoonSang Jin y F. Somenzi. "Strong Conflict Analysis for Propositional Satisfiability". En 2006 Design, Automation and Test in Europe. IEEE, 2006. http://dx.doi.org/10.1109/date.2006.244149.
Texto completoMonnet, Anthony y Roger Villemaire. "Scalable formula decomposition for propositional satisfiability". En the Third C* Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1822327.1822333.
Texto completoYujuan Zhao y Zhenming Song. "A new branching heuristic for propositional satisfiability". En 2016 International Conference on Fuzzy Theory and Its Applications (iFuzzy). IEEE, 2016. http://dx.doi.org/10.1109/ifuzzy.2016.8004924.
Texto completoNakamura, Kazuhiro, Shinji Maruoka, Shinji Kimura y Katsumasa Watanabe. "Multi-clock path analysis using propositional satisfiability". En the 2000 conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/368434.368533.
Texto completoGrossi, Davide, Emiliano Lorini y François Schwarzentruber. "The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)". En 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.
Texto completoJensen, Richard, Andrew Tuson y Qiang Shen. "Extending propositional satisfiability to determine minimal fuzzy-rough reducts". En 2010 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2010. http://dx.doi.org/10.1109/fuzzy.2010.5584470.
Texto completoZou, Li y Wenjiang Li. "Satisfiability Problem of Linguistic Truth-Valued Intuitionistic Propositional Logic". En 2008 3rd International Conference on Innovative Computing Information and Control. IEEE, 2008. http://dx.doi.org/10.1109/icicic.2008.485.
Texto completoCaleiro, Carlos, Filipe Casal y Andreia Mordido. "Classical Generalized Probabilistic Satisfiability". En 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.
Texto completoSurynek, Pavel. "Mutex reasoning in cooperative path finding modeled as propositional satisfiability". En 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013). IEEE, 2013. http://dx.doi.org/10.1109/iros.2013.6696977.
Texto completoJabbour, Said, Nizar Mhadbhi, Badran Raddaoui y Lakhdar Sais. "Triangle-Driven Community Detection in Large Graphs Using Propositional Satisfiability". En 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications (AINA). IEEE, 2018. http://dx.doi.org/10.1109/aina.2018.00072.
Texto completoInformes sobre el tema "Propositional satisfiability"
Lutz, Carsten y Dirk Walther. PDL with Negation of Atomic Programs. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.129.
Texto completoBorgwardt, Stefan, Marcel Lippmann y Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.
Texto completoBaader, Franz, Stefan Borgwardt y 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.
Texto completoBaader, Franz, Pavlos Marantidis y Alexander Okhotin. Approximately Solving Set Equations. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.227.
Texto completoBaader, Franz y Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.
Texto completoBaader, Franz y Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
Texto completo