Journal articles on the topic 'Propositional satisfiability problems'
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 problems.'
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 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 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 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 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 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 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 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 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 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 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 textMayer, Joachim, Ilse Mitterreiter, and Franz Josef Radermacher. "Running time experiments on some algorithms for solving propositional satisfiability problems." Annals of Operations Research 55, no. 1 (February 1995): 139–78. http://dx.doi.org/10.1007/bf02031719.
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 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 textL. C., Kho, Kasihmuddin M. S. M., Mansor M. A., and Sathasivam S. "Propositional Satisfiability Logic via Ant Colony Optimization in Hopfield Neural Network." Malaysian Journal of Mathematical Sciences 16, no. 1 (January 31, 2022): 37–53. http://dx.doi.org/10.47836/mjms.16.1.04.
Full textPreto, Sandro Márcio da Silva. "Semantics modulo satisfiability with applications: function representation, probabilities and game theory." Bulletin of Symbolic Logic 28, no. 2 (June 2022): 264–65. http://dx.doi.org/10.1017/bsl.2022.2.
Full textSIMON, J. C., and O. DUBOIS. "NUMBER OF SOLUTIONS OF SATISFIABILITY INSTANCES—APPLICATIONS TO KNOWLEDGE BASES." International Journal of Pattern Recognition and Artificial Intelligence 03, no. 01 (March 1989): 53–65. http://dx.doi.org/10.1142/s0218001489000061.
Full textBalyo, Tomáš, Roman Barták, and Otakar Trunda. "REINFORCED ENCODING FOR PLANNING AS SAT." Acta Polytechnica CTU Proceedings 2, no. 2 (December 31, 2015): 1–7. http://dx.doi.org/10.14311/app.2015.1.0001.
Full textGiunchiglia, E., M. Narizzano, and A. Tacchella. "Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas." Journal of Artificial Intelligence Research 26 (August 17, 2006): 371–416. http://dx.doi.org/10.1613/jair.1959.
Full textBalyo, Tomáš, and Roman Barták. "No One SATPlan Encoding To Rule Them All." Proceedings of the International Symposium on Combinatorial Search 6, no. 1 (September 1, 2021): 146–50. http://dx.doi.org/10.1609/socs.v6i1.18371.
Full textStephen, Shirly, and Torsten Hahmann. "Identifying Bottlenecks in Practical SAT-Based Model Finding for First-Order Logic Ontologies with Datasets." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 10039–40. http://dx.doi.org/10.1609/aaai.v33i01.330110039.
Full textAMENDOLA, GIOVANNI, CARMINE DODARO, and MARCO MARATEA. "Abstract Solvers for Computing Cautious Consequences of ASP programs." Theory and Practice of Logic Programming 19, no. 5-6 (September 2019): 740–56. http://dx.doi.org/10.1017/s1471068419000164.
Full textBRAHA, DAN. "Design-as-satisfiability: A new approach to automated synthesis." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 15, no. 5 (November 2001): 385–99. http://dx.doi.org/10.1017/s0890060401155022.
Full textLIU, JIMING, XIAOLONG JIN, and JING HAN. "DISTRIBUTED PROBLEM SOLVING WITHOUT COMMUNICATION — AN EXAMINATION OF COMPUTATIONALLY HARD SATISFIABILITY PROBLEMS." International Journal of Pattern Recognition and Artificial Intelligence 16, no. 08 (December 2002): 1041–64. http://dx.doi.org/10.1142/s0218001402002143.
Full textRichardson, Kyle, and Ashish Sabharwal. "Pushing the Limits of Rule Reasoning in Transformers through Natural Language Satisfiability." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 10 (June 28, 2022): 11209–19. http://dx.doi.org/10.1609/aaai.v36i10.21371.
Full textKurup, Unmesh, and Nicholas Cassimatis. "Integrating Constraint Satisfaction and Spatial Reasoning." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 5, 2010): 1536–41. http://dx.doi.org/10.1609/aaai.v24i1.7574.
Full textHao and Liu. "Enhanced Membrane Computing Algorithm for SAT Problems Based on the Splitting Rule." Symmetry 11, no. 11 (November 15, 2019): 1412. http://dx.doi.org/10.3390/sym11111412.
Full textTEO, JASON, and HUSSEIN A. ABBASS. "A TRUE ANNEALING APPROACH TO THE MARRIAGE IN HONEY-BEES OPTIMIZATION ALGORITHM." International Journal of Computational Intelligence and Applications 03, no. 02 (June 2003): 199–211. http://dx.doi.org/10.1142/s146902680300094x.
Full textLittman, M. L., J. Goldsmith, and M. Mundhenk. "The Computational Complexity of Probabilistic Planning." Journal of Artificial Intelligence Research 9 (August 1, 1998): 1–36. http://dx.doi.org/10.1613/jair.505.
Full textWU, HUAYUE, and PETER VAN BEEK. "PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH." International Journal on Artificial Intelligence Tools 17, no. 05 (October 2008): 835–56. http://dx.doi.org/10.1142/s0218213008004187.
Full textGrädel, Erich. "On the Restraining Power of Guards." Journal of Symbolic Logic 64, no. 4 (December 1999): 1719–42. http://dx.doi.org/10.2307/2586808.
Full textGIUNCHIGLIA, FAUSTO, and PAVEL SHVAIKO. "Semantic matching." Knowledge Engineering Review 18, no. 3 (September 2003): 265–80. http://dx.doi.org/10.1017/s0269888904000074.
Full textSurynek, Pavel. "Preprocessing in Propositional Satisfiability Using Bounded (2, k)-Consistency on Regions with a Locally Difficult Constraint Setup." International Journal on Artificial Intelligence Tools 23, no. 01 (February 2014): 1350029. http://dx.doi.org/10.1142/s0218213013500292.
Full textDOVIER, AGOSTINO. "Preface." Theory and Practice of Logic Programming 17, no. 4 (July 2017): 359–64. http://dx.doi.org/10.1017/s1471068417000199.
Full textGent, I. P., and T. Walsh. "An Empirical Analysis of Search in GSAT." Journal of Artificial Intelligence Research 1 (September 1, 1993): 47–59. http://dx.doi.org/10.1613/jair.7.
Full textQiu, Junming, Wenqing Li, Zhanhao Xiao, Quanlong Guan, Liangda Fang, Zhao-Rong Lai, and Qian Dong. "Knowledge Compilation Meets Logical Separability." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 5851–60. http://dx.doi.org/10.1609/aaai.v36i5.20529.
Full textIshebabi, Harold, Philipp Mahr, Christophe Bobda, Martin Gebser, and Torsten Schaub. "Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real-Time Parallel Programs." International Journal of Reconfigurable Computing 2009 (2009): 1–11. http://dx.doi.org/10.1155/2009/863630.
Full textBienvenu, Meghyn, Camille Bourgaux, and François Goasdoué. "Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases." Journal of Artificial Intelligence Research 64 (March 10, 2019): 563–644. http://dx.doi.org/10.1613/jair.1.11395.
Full textFichte, Johannes, and Stefan Szeider. "Backdoors to Normality for Disjunctive Logic Programs." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 320–27. http://dx.doi.org/10.1609/aaai.v27i1.8624.
Full textKerschke, Pascal, Holger H. Hoos, Frank Neumann, and Heike Trautmann. "Automated Algorithm Selection: Survey and Perspectives." Evolutionary Computation 27, no. 1 (March 2019): 3–45. http://dx.doi.org/10.1162/evco_a_00242.
Full textFichte, Johannes. "Backdoors to Tractability of Answer-Set Programming." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 29, 2013): 1662–63. http://dx.doi.org/10.1609/aaai.v27i1.8505.
Full textKlimek, Radosław, Katarzyna Grobler-Dębska, and Edyta Kucharska. "System for automatic generation of logical formulas." MATEC Web of Conferences 252 (2019): 03005. http://dx.doi.org/10.1051/matecconf/201925203005.
Full textChang, Wenjing, Hengkai Zhang, and Junwei Luo. "Predicting Propositional Satisfiability Based on Graph Attention Networks." International Journal of Computational Intelligence Systems 15, no. 1 (September 28, 2022). http://dx.doi.org/10.1007/s44196-022-00139-9.
Full textDransfield, Michael R., Lengning Liu, Victor W. Marek, and Mirosław Truszczyński. "Satisfiability and Computing van der Waerden Numbers." Electronic Journal of Combinatorics 11, no. 1 (June 16, 2004). http://dx.doi.org/10.37236/1794.
Full textMahmood, Yasir, and Arne Meier. "Parameterised complexity of model checking and satisfiability in propositional dependence logic." Annals of Mathematics and Artificial Intelligence, February 27, 2021. http://dx.doi.org/10.1007/s10472-021-09730-w.
Full textBearden, Sean R. B., Yan Ru Pei, and Massimiliano Di Ventra. "Efficient solution of Boolean satisfiability problems with digital memcomputing." Scientific Reports 10, no. 1 (November 12, 2020). http://dx.doi.org/10.1038/s41598-020-76666-2.
Full textFröhlich, Andreas, Armin Biere, Christoph Wintersteiger, and Youssef Hamadi. "Stochastic Local Search for Satisfiability Modulo Theories." Proceedings of the AAAI Conference on Artificial Intelligence 29, no. 1 (February 16, 2015). http://dx.doi.org/10.1609/aaai.v29i1.9372.
Full textBienvenu, Meghyn, Camille Bourgaux, and François Goasdoué. "Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases." Proceedings of the AAAI Conference on Artificial Intelligence 30, no. 1 (February 21, 2016). http://dx.doi.org/10.1609/aaai.v30i1.10092.
Full textLange, Martin. "Temporal Logics Beyond Regularity." BRICS Report Series 14, no. 13 (January 13, 2007). http://dx.doi.org/10.7146/brics.v14i13.22178.
Full textSemenov, Alexander, Oleg Zaikin, Ilya Otpuschennikov, Stepan Kochemazov, and Alexey Ignatiev. "On Cryptographic Attacks Using Backdoors for SAT." Proceedings of the AAAI Conference on Artificial Intelligence 32, no. 1 (April 26, 2018). http://dx.doi.org/10.1609/aaai.v32i1.12205.
Full text