Journal articles on the topic 'Propositional satisfiability'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research 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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
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 textLIERLER, YULIYA, and MIROSLAW TRUSZCZYNSKI. "Transition systems for model generators—A unifying approach." Theory and Practice of Logic Programming 11, no. 4-5 (July 2011): 629–46. http://dx.doi.org/10.1017/s1471068411000214.
Full textBonet, Maria Luisa, Sam Buss, Alexey Ignatiev, Antonio Morgado, and Joao Marques-Silva. "Propositional proof systems based on maximum satisfiability." Artificial Intelligence 300 (November 2021): 103552. http://dx.doi.org/10.1016/j.artint.2021.103552.
Full textPinkas, Gadi. "Symmetric Neural Networks and Propositional Logic Satisfiability." Neural Computation 3, no. 2 (June 1991): 282–91. http://dx.doi.org/10.1162/neco.1991.3.2.282.
Full textBruni, Renato, and Antonio Sassano. "A complete adaptive algorithm for propositional satisfiability." Discrete Applied Mathematics 127, no. 3 (May 2003): 523–34. http://dx.doi.org/10.1016/s0166-218x(02)00385-2.
Full textWalsh, William E., Makoto Yokoo, Katsutoshi Hirayama, and Michael P. Wellman. "On market-inspired approaches to propositional satisfiability." Artificial Intelligence 144, no. 1-2 (March 2003): 125–56. http://dx.doi.org/10.1016/s0004-3702(02)00386-7.
Full textMarques-Silva, J. P., and K. A. Sakallah. "GRASP: a search algorithm for propositional satisfiability." IEEE Transactions on Computers 48, no. 5 (May 1999): 506–21. http://dx.doi.org/10.1109/12.769433.
Full textHirsch, E. A. "Separating signs in the propositional satisfiability problem." Journal of Mathematical Sciences 98, no. 4 (February 2000): 442–63. http://dx.doi.org/10.1007/bf02362266.
Full textBhalla, Ateet, Inês Lynce, José T. de Sousa, and João Marques-Silva. "Heuristic-Based Backtracking Relaxation for Propositional Satisfiability." Journal of Automated Reasoning 35, no. 1-3 (October 2005): 3–24. http://dx.doi.org/10.1007/s10817-005-9005-y.
Full textGiunchiglia, Enrico, Yuliya Lierler, and Marco Maratea. "Answer Set Programming Based on Propositional Satisfiability." Journal of Automated Reasoning 36, no. 4 (September 29, 2006): 345–77. http://dx.doi.org/10.1007/s10817-006-9033-2.
Full textSegerlind, Nathan. "The Complexity of Propositional Proofs." Bulletin of Symbolic Logic 13, no. 4 (December 2007): 417–81. http://dx.doi.org/10.2178/bsl/1203350879.
Full textPratt-Hartmann, Ian. "On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics." Bulletin of Symbolic Logic 14, no. 1 (March 2008): 1–28. http://dx.doi.org/10.2178/bsl/1208358842.
Full textCameron, Chris, Rex Chen, Jason Hartford, and Kevin Leyton-Brown. "Predicting Propositional Satisfiability via End-to-End Learning." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 3324–31. http://dx.doi.org/10.1609/aaai.v34i04.5733.
Full textMohd Kasihmuddin, Mohd Shareduwan, Mohd Asyraf Mansor, Md Faisal Md Basir, and Saratha Sathasivam. "Discrete Mutation Hopfield Neural Network in Propositional Satisfiability." Mathematics 7, no. 11 (November 19, 2019): 1133. http://dx.doi.org/10.3390/math7111133.
Full textCastaño, José M., and Rodrigo Castaño. "A finite state intersection approach to propositional satisfiability." Theoretical Computer Science 450 (September 2012): 92–108. http://dx.doi.org/10.1016/j.tcs.2012.04.030.
Full textBlochinger, Wolfgang, Carsten Sinz, and Wolfgang Küchlin. "Parallel propositional satisfiability checking with distributed dynamic learning." Parallel Computing 29, no. 7 (July 2003): 969–94. http://dx.doi.org/10.1016/s0167-8191(03)00068-1.
Full textGallo, G., and D. Pretolani. "A new algorithm for the propositional satisfiability problem." Discrete Applied Mathematics 60, no. 1-3 (June 1995): 159–79. http://dx.doi.org/10.1016/0166-218x(94)00048-i.
Full textInoue, Katsumi, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, and Naoyuki Tamura. "A competitive and cooperative approach to propositional satisfiability." Discrete Applied Mathematics 154, no. 16 (November 2006): 2291–306. http://dx.doi.org/10.1016/j.dam.2006.04.015.
Full textVan Gelder, Allen. "Another look at graph coloring via propositional satisfiability." Discrete Applied Mathematics 156, no. 2 (January 2008): 230–43. http://dx.doi.org/10.1016/j.dam.2006.07.016.
Full textGallo, Giorgio, and Giampaolo Urbani. "Algorithms for testing the satisfiability of propositional formulae." Journal of Logic Programming 7, no. 1 (July 1989): 45–61. http://dx.doi.org/10.1016/0743-1066(89)90009-5.
Full textVan Gelder, Allen. "A satisfiability tester for non-clausal propositional calculus." Information and Computation 79, no. 1 (October 1988): 1–21. http://dx.doi.org/10.1016/0890-5401(88)90014-4.
Full textPham, Duc Nghia, John Thornton, and Abdul Sattar. "Modelling and solving temporal reasoning as propositional satisfiability." Artificial Intelligence 172, no. 15 (October 2008): 1752–82. http://dx.doi.org/10.1016/j.artint.2008.06.003.
Full textLierler, Yuliya. "What is answer set programming to propositional satisfiability." Constraints 22, no. 3 (December 16, 2016): 307–37. http://dx.doi.org/10.1007/s10601-016-9257-7.
Full textMOUHOUB, MALEK. "SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT." International Journal of Computational Intelligence and Applications 07, no. 01 (March 2008): 77–96. http://dx.doi.org/10.1142/s1469026808002193.
Full textDUCK, GREGORY J. "SMCHR: Satisfiability modulo constraint handling rules." Theory and Practice of Logic Programming 12, no. 4-5 (July 2012): 601–18. http://dx.doi.org/10.1017/s1471068412000208.
Full textBalu, Radhakrishnan, Dale Shires, and 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, no. 1 (May 17, 2016): 57–65. http://dx.doi.org/10.1177/1548512916648232.
Full textALVIANO, MARIO, SOTIRIS BATSAKIS, and GEORGE BARYANNIS. "Modal Logic S5 Satisfiability in Answer Set Programming." Theory and Practice of Logic Programming 21, no. 5 (September 2021): 527–42. http://dx.doi.org/10.1017/s1471068421000247.
Full textIgnatiev, Alexey, Yacine Izza, Peter J. Stuckey, and Joao Marques-Silva. "Using MaxSAT for Efficient Explanations of Tree Ensembles." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (June 28, 2022): 3776–85. http://dx.doi.org/10.1609/aaai.v36i4.20292.
Full textReith, Steffen, and Heribert Vollmer. "Optimal satisfiability for propositional calculi and constraint satisfaction problems." Information and Computation 186, no. 1 (October 2003): 1–19. http://dx.doi.org/10.1016/s0890-5401(03)00092-0.
Full textHarche, F., J. N. Hooker, and G. L. Thompson. "A Computational Study of Satisfiability Algorithms for Propositional Logic." ORSA Journal on Computing 6, no. 4 (November 1994): 423–35. http://dx.doi.org/10.1287/ijoc.6.4.423.
Full textHamadi, Youssef, Saïd Jabbour, and Lakhdar Saïs. "What we can learn from conflicts in propositional satisfiability." Annals of Operations Research 240, no. 1 (October 1, 2015): 13–37. http://dx.doi.org/10.1007/s10479-015-2028-9.
Full textBofill, Miquel, Joan Espasa, and Mateu Villaret. "A Semantic Notion of Interference for Planning Modulo Theories." Proceedings of the International Conference on Automated Planning and Scheduling 26 (March 30, 2016): 56–64. http://dx.doi.org/10.1609/icaps.v26i1.13734.
Full textLIMA, PRISCILA M. V., M. MARIELA M. MORVELI-ESPINOZA, GLAUCIA C. PEREIRA, TALITA O. FERREIRA, and FELIPE M. G. FRANÇA. "LOGICAL REASONING VIA SATISFIABILITY MAPPED INTO ENERGY FUNCTIONS." International Journal of Pattern Recognition and Artificial Intelligence 22, no. 05 (August 2008): 1031–43. http://dx.doi.org/10.1142/s0218001408006673.
Full textCimatti, A., A. Griggio, and R. Sebastiani. "Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories." Journal of Artificial Intelligence Research 40 (April 14, 2011): 701–28. http://dx.doi.org/10.1613/jair.3196.
Full textLimón-Priego, Yensen, Ismael Everardo Bárcenas-Patiño, Edgard Iván Benítez-Guerrero, Guillermo Gilberto Molero-Castillo, and Alejandro Velazquez-Mena. "Mu-Calculus Satisfiability with Arithmetic Constraints." Proceedings of the Institute for System Programming of the RAS 33, no. 2 (2021): 191–200. http://dx.doi.org/10.15514/ispras-2021-33(2)-12.
Full textBoudane, Abdelhamid, Saïd Jabbour, Lakhdar Sais, and Yakoub Salhi. "SAT-Based Data Mining." International Journal on Artificial Intelligence Tools 27, no. 01 (February 2018): 1840002. http://dx.doi.org/10.1142/s021821301840002x.
Full textStefan Göller, Markus Lohrey, and Carsten Lutz. "PDL with intersection and converse: satisfiability and infinite-state model checking." Journal of Symbolic Logic 74, no. 1 (March 2009): 279–314. http://dx.doi.org/10.2178/jsl/1231082313.
Full textNeumann, Frank, and Andrew M. Sutton. "Evolving Solutions to Community-Structured Satisfiability Formulas." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2346–53. http://dx.doi.org/10.1609/aaai.v33i01.33012346.
Full textBakar, A. A., M. N. Sulaiman, M. Othman, and M. H. Selamat. "Propositional Satisfiability Algorithm to Find Minimal Reducts for Data Mining." International Journal of Computer Mathematics 79, no. 4 (January 2002): 379–89. http://dx.doi.org/10.1080/00207160210938.
Full textOhyanagi, Toshio, Masahito Yamamoto, and Azuma Ohuchi. "An Algorithm for β Clause Satisfiability Problem in Propositional Logic." IEEJ Transactions on Electronics, Information and Systems 114, no. 7-8 (1994): 796–804. http://dx.doi.org/10.1541/ieejeiss1987.114.7-8_796.
Full textWOLFMAN, STEVEN A., and DANIEL S. WELD. "Combining linear programming and satisfiability solving for resource planning." Knowledge Engineering Review 16, no. 1 (March 2001): 85–99. http://dx.doi.org/10.1017/s0269888901000017.
Full text