Journal articles on the topic 'Satisfiability theory'
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 'Satisfiability theory.'
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.
Dixon, H. E., M. L. Ginsberg, E. M. Luks, and A. J. Parkes. "Generalizing Boolean Satisfiability II: Theory." Journal of Artificial Intelligence Research 22 (December 1, 2004): 481–534. http://dx.doi.org/10.1613/jair.1555.
Full textMichaliszyn, Jakub, Jan Otop, and Piotr Witkowski. "Satisfiability versus Finite Satisfiability in Elementary Modal Logics." Fundamenta Informaticae 163, no. 2 (November 3, 2018): 165–88. http://dx.doi.org/10.3233/fi-2018-1736.
Full textUtomo, Putranto. "Satisfiability modulo theory and binary puzzle." Journal of Physics: Conference Series 855 (June 2017): 012057. http://dx.doi.org/10.1088/1742-6596/855/1/012057.
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 textAlon, Noga, and Asaf Shapira. "Testing satisfiability." Journal of Algorithms 47, no. 2 (July 2003): 87–103. http://dx.doi.org/10.1016/s0196-6774(03)00019-1.
Full textLiao, Xiaojuan, Hui Zhang, Miyuki Koshimura, Rong Huang, Wenxin Yu, and Fagen Li. "Modeling and Solving Scheduling in Overloaded Situations with Weighted Partial MaxSAT." Mathematical Problems in Engineering 2021 (July 16, 2021): 1–17. http://dx.doi.org/10.1155/2021/9615463.
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 textIgnatiev, Alexey, Mikoláš Janota, and Joao Marques-Silva. "Quantified maximum satisfiability." Constraints 21, no. 2 (May 24, 2015): 277–302. http://dx.doi.org/10.1007/s10601-015-9195-9.
Full textHooker, J. N., and V. Vinay. "Branching rules for satisfiability." Journal of Automated Reasoning 15, no. 3 (1995): 359–83. http://dx.doi.org/10.1007/bf00881805.
Full textOMODEO, EUGENIO G., ALBERTO POLICRITI, and ALEXANDRU I. TOMESCU. "Set-syllogistics meet combinatorics." Mathematical Structures in Computer Science 27, no. 2 (May 11, 2015): 296–310. http://dx.doi.org/10.1017/s0960129515000122.
Full textLynce, Inês, and Joao Marques-Silva. "Restoring CSP Satisfiability with MaxSAT." Fundamenta Informaticae 107, no. 2-3 (2011): 249–66. http://dx.doi.org/10.3233/fi-2011-402.
Full textDavenport, James H., Matthew England, Alberto Griggio, Thomas Sturm, and Cesare Tinelli. "Symbolic computation and satisfiability checking." Journal of Symbolic Computation 100 (September 2020): 1–10. http://dx.doi.org/10.1016/j.jsc.2019.07.017.
Full textLiangze Yin, Fei He, William N. N. Hung, Xiaoyu Song, and Ming Gu. "Maxterm Covering for Satisfiability." IEEE Transactions on Computers 61, no. 3 (March 2012): 420–26. http://dx.doi.org/10.1109/tc.2010.270.
Full textLaumann, C. R., R. Moessner, A. Scarddichio, and S. L. Sondhi. "Random quantum satisfiability." Quantum Information and Computation 10, no. 1&2 (January 2010): 1–16. http://dx.doi.org/10.26421/qic10.1-2-1.
Full textCODISH, MICHAEL, VITALY LAGOON, and PETER J. STUCKEY. "Logic programming with satisfiability." Theory and Practice of Logic Programming 8, no. 01 (May 25, 2007): 121–28. http://dx.doi.org/10.1017/s1471068407003146.
Full textDixon, H. E., M. L. Ginsberg, D. Hofer, E. M. Luks, and A. J. Parkes. "Generalizing Boolean Satisfiability III: Implementation." Journal of Artificial Intelligence Research 23 (April 1, 2005): 441–531. http://dx.doi.org/10.1613/jair.1656.
Full textPan, Guoqiang, and Moshe Y. Vardi. "Symbolic Techniques in Satisfiability Solving." Journal of Automated Reasoning 35, no. 1-3 (December 17, 2005): 25–50. http://dx.doi.org/10.1007/s10817-005-9009-7.
Full textGiunchiglia, Enrico, and Toby Walsh. "Satisfiability in the Year 2005." Journal of Automated Reasoning 35, no. 1-3 (August 31, 2006): 1–2. http://dx.doi.org/10.1007/s10817-006-9041-2.
Full textHuang, Xiong, and Wei Li. "Onk-positive satisfiability problem." Journal of Computer Science and Technology 14, no. 4 (July 1999): 309–13. http://dx.doi.org/10.1007/bf02948732.
Full textCimatti, Alessandro, Sergio Mover, and Stefano Tonetta. "SMT-Based Verification of Hybrid Systems." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 2100–2105. http://dx.doi.org/10.1609/aaai.v26i1.8442.
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 textMarques-Silva, Joao. "Model checking with Boolean Satisfiability." Journal of Algorithms 63, no. 1-3 (January 2008): 3–16. http://dx.doi.org/10.1016/j.jalgor.2008.02.007.
Full textBruni, Renato. "Solving peptide sequencing as satisfiability." Computers & Mathematics with Applications 55, no. 5 (March 2008): 912–23. http://dx.doi.org/10.1016/j.camwa.2006.12.094.
Full textPratt, Vaughan, and Jerzy Tiuryn. "Satisfiability of Inequalities in a Poset." Fundamenta Informaticae 28, no. 1,2 (1996): 165–82. http://dx.doi.org/10.3233/fi-1996-281211.
Full textLETOMBE, FLORIAN, and JOAO MARQUES-SILVA. "HYBRID INCREMENTAL ALGORITHMS FOR BOOLEAN SATISFIABILITY." International Journal on Artificial Intelligence Tools 21, no. 06 (December 2012): 1250025. http://dx.doi.org/10.1142/s021821301250025x.
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 textLiang, Chen, Xiaofeng Wang, Lei Lu, and Pengfei Niu. "A New Method for 3-Satisfiability Problem Solving Space Structure on Structural Entropy." Symmetry 13, no. 11 (October 22, 2021): 2005. http://dx.doi.org/10.3390/sym13112005.
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 textDiedrich, Alexander, Alexander Maier, and Oliver Niggemann. "Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 1452–59. http://dx.doi.org/10.1609/aaai.v33i01.33011452.
Full textBonacina, Maria Paola, Stéphane Graham-Lengrand, and Natarajan Shankar. "Conflict-Driven Satisfiability for Theory Combination: Transition System and Completeness." Journal of Automated Reasoning 64, no. 3 (January 4, 2019): 579–609. http://dx.doi.org/10.1007/s10817-018-09510-y.
Full textCantone, Domenico, Andrea De Domenico, Pietro Maugeri, and Eugenio G. Omodeo. "Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*." Fundamenta Informaticae 181, no. 1 (June 30, 2021): 37–69. http://dx.doi.org/10.3233/fi-2021-2050.
Full textDi Rosa, Emanuele, Enrico Giunchiglia, and Marco Maratea. "Solving satisfiability problems with preferences." Constraints 15, no. 4 (July 3, 2010): 485–515. http://dx.doi.org/10.1007/s10601-010-9095-y.
Full textIshtaiwi, Abdelraouf, and Qasem Abu Al-Haija. "Dynamic Initial Weight Assignment for MaxSAT." Algorithms 14, no. 4 (March 31, 2021): 115. http://dx.doi.org/10.3390/a14040115.
Full textNiemetz, Aina, Mathias Preiner, Andrew Reynolds, Yoni Zohar, Clark Barrett, and Cesare Tinelli. "Towards Satisfiability Modulo Parametric Bit-vectors." Journal of Automated Reasoning 65, no. 7 (June 18, 2021): 1001–25. http://dx.doi.org/10.1007/s10817-021-09598-9.
Full textPipatsrisawat, Knot, and Adnan Darwiche. "On Modern Clause-Learning Satisfiability Solvers." Journal of Automated Reasoning 44, no. 3 (November 6, 2009): 277–301. http://dx.doi.org/10.1007/s10817-009-9156-3.
Full textPITTEL, BORIS, and GREGORY B. SORKIN. "The Satisfiability Threshold fork-XORSAT." Combinatorics, Probability and Computing 25, no. 2 (July 31, 2015): 236–68. http://dx.doi.org/10.1017/s0963548315000097.
Full textFortnow, Lance. "Time–Space Tradeoffs for Satisfiability." Journal of Computer and System Sciences 60, no. 2 (April 2000): 337–53. http://dx.doi.org/10.1006/jcss.1999.1671.
Full textCarapelle, Claudia, Alexander Kartzow, and Markus Lohrey. "Satisfiability of ECTL⁎ with constraints." Journal of Computer and System Sciences 82, no. 5 (August 2016): 826–55. http://dx.doi.org/10.1016/j.jcss.2016.02.002.
Full textYannakakis, M. "On the Approximation of Maximum Satisfiability." Journal of Algorithms 17, no. 3 (November 1994): 475–502. http://dx.doi.org/10.1006/jagm.1994.1045.
Full textNiedermeier, Rolf, and Peter Rossmanith. "New Upper Bounds for Maximum Satisfiability." Journal of Algorithms 36, no. 1 (July 2000): 63–88. http://dx.doi.org/10.1006/jagm.2000.1075.
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 textFERNÁNDEZ, MARIBEL. "AC Complement Problems: Satisfiability and Negation Elimination." Journal of Symbolic Computation 22, no. 1 (July 1996): 49–82. http://dx.doi.org/10.1006/jsco.1996.0041.
Full textLIERLER, YULIYA, and BENJAMIN SUSMAN. "On relation between constraint answer set programming and satisfiability modulo theories." Theory and Practice of Logic Programming 17, no. 4 (June 28, 2017): 559–90. http://dx.doi.org/10.1017/s1471068417000114.
Full textDE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Solving Horn Clauses on Inductive Data Types Without Induction." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 452–69. http://dx.doi.org/10.1017/s1471068418000157.
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 textCantone, Domenico, Alfio Giarlotta, and Stephen Watson. "The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence." Electronic Proceedings in Theoretical Computer Science 256 (September 6, 2017): 61–75. http://dx.doi.org/10.4204/eptcs.256.5.
Full textZhou, Haijun. "Solution space heterogeneity of the randomK-satisfiability problem: Theory and simulations." Journal of Physics: Conference Series 233 (June 1, 2010): 012011. http://dx.doi.org/10.1088/1742-6596/233/1/012011.
Full textAloul, F. A., K. A. Sakallah, and I. L. Markov. "Efficient symmetry breaking for Boolean satisfiability." IEEE Transactions on Computers 55, no. 5 (May 2006): 549–58. http://dx.doi.org/10.1109/tc.2006.75.
Full textGhilardi, Silvio. "Model-Theoretic Methods in Combined Constraint Satisfiability." Journal of Automated Reasoning 33, no. 3-4 (October 2004): 221–49. http://dx.doi.org/10.1007/s10817-004-6241-5.
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 text