Search Results

There are 28912 results for: content related to: A feedback technique for unsatisfiable UML/OCL class diagrams

  1. Automated theorem proving

    Wiley Interdisciplinary Reviews: Cognitive Science

    Volume 5, Issue 2, March/April 2014, Pages: 115–128, David A. Plaisted

    Version of Record online : 17 JAN 2014, DOI: 10.1002/wcs.1269

  2. On the concentration of the number of solutions of random satisfiability formulas

    Random Structures & Algorithms

    Volume 45, Issue 3, October 2014, Pages: 362–382, Emmanuel Abbe and Andrea Montanari

    Version of Record online : 12 APR 2013, DOI: 10.1002/rsa.20501

  3. Random k-SAT and the power of two choices

    Random Structures & Algorithms

    Volume 47, Issue 1, August 2015, Pages: 163–173, Will Perkins

    Version of Record online : 19 MAR 2014, DOI: 10.1002/rsa.20534

  4. REASONING WITH TOPOLOGICAL AND DIRECTIONAL SPATIAL INFORMATION

    Computational Intelligence

    Volume 28, Issue 4, November 2012, Pages: 579–616, Sanjiang Li and Anthony G. Cohn

    Version of Record online : 8 AUG 2012, DOI: 10.1111/j.1467-8640.2012.00431.x

  5. Computational aspects of satisfiability in probability logic

    Mathematical Logic Quarterly

    Volume 60, Issue 6, November 2014, Pages: 444–470, Rutger Kuyper

    Version of Record online : 22 OCT 2014, DOI: 10.1002/malq.201300015

  6. A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs

    International Journal of Intelligent Systems

    Volume 26, Issue 11, November 2011, Pages: 1023–1048, I. Shah

    Version of Record online : 10 AUG 2011, DOI: 10.1002/int.20497

  7. The Random 3-Satisfiability Problem: From the Phase Transition to the Efficient Generation of Hard, but Satisfiable Problem Instances

    New Optimization Algorithms in Physics

    Alexander K. Hartmann, Heiko Rieger, Pages: 119–137, 2005

    Published Online : 6 JUN 2005, DOI: 10.1002/3527603794.ch7

  8. A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas

    Random Structures & Algorithms

    Volume 31, Issue 2, September 2007, Pages: 173–185, Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos and Moshe Y. Vardi

    Version of Record online : 1 MAY 2007, DOI: 10.1002/rsa.20176

  9. Random MAX SAT, random MAX CUT, and their phase transitions

    Random Structures & Algorithms

    Volume 24, Issue 4, July 2004, Pages: 502–545, Don Coppersmith, David Gamarnik, MohammadTaghi Hajiaghayi and Gregory B. Sorkin

    Version of Record online : 6 MAY 2004, DOI: 10.1002/rsa.20015

  10. Simple monadic theories and partition width

    Mathematical Logic Quarterly

    Volume 57, Issue 4, August 2011, Pages: 409–431, Achim Blumensath

    Version of Record online : 2 MAY 2011, DOI: 10.1002/malq.201010019

  11. Automated metamorphic testing of variability analysis tools

    Software Testing, Verification and Reliability

    Volume 25, Issue 2, March 2015, Pages: 138–163, Sergio Segura, Amador Durán, Ana B. Sánchez, Daniel Le Berre, Emmanuel Lonca and Antonio Ruiz-Cortés

    Version of Record online : 13 JAN 2015, DOI: 10.1002/stvr.1566

  12. Construction of Rough Information Granules

    Handbook of Granular Computing

    Witold Pedrycz, Andrzej Skowron, Vladik Kreinovich, Pages: 449–470, 2008

    Published Online : 16 JUL 2008, DOI: 10.1002/9780470724163.ch20

  13. Automated Theorem Proving

    Standard Article

    Wiley Encyclopedia of Computer Science and Engineering

    Published Online : 15 JAN 2008, DOI: 10.1002/9780470050118.ecse434

  14. A procedure for satiosfiability problems based on the partial instantiation technique

    Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

    Volume 78, Issue 9, September 1995, Pages: 94–103, Masahito Yamamoto, Azuma Ohuchi and Toshio Ohyanagi

    Version of Record online : 26 FEB 2007, DOI: 10.1002/ecjc.4430780910

  15. Theorem Proving

    Standard Article

    Wiley Encyclopedia of Electrical and Electronics Engineering

    David A. Plaisted

    Published Online : 27 DEC 1999, DOI: 10.1002/047134608X.W4333

  16. The probabilistic analysis of a greedy satisfiability algorithm

    Random Structures & Algorithms

    Volume 28, Issue 4, July 2006, Pages: 444–480, Alexis C. Kaporis, Lefteris M. Kirousis and Efthimios G. Lalas

    Version of Record online : 8 NOV 2005, DOI: 10.1002/rsa.20104

  17. A p-adic probability logic

    Mathematical Logic Quarterly

    Volume 58, Issue 4-5, August 2012, Pages: 263–280, Angelina Ilić-Stepić, Zoran Ognjanović, Nebojša Ikodinović and Aleksandar Perović

    Version of Record online : 20 JUN 2012, DOI: 10.1002/malq.201110006

  18. Bridging the gap between easy generation and efficient verification of unsatisfiability proofs

    Software Testing, Verification and Reliability

    Volume 24, Issue 8, December 2014, Pages: 593–607, Marijn J. H. Heule, Warren A. Hunt Jr. and Nathan Wetzler

    Version of Record online : 3 OCT 2014, DOI: 10.1002/stvr.1549

  19. The phase transition in random horn satisfiability and its algorithmic implications

    Random Structures & Algorithms

    Volume 20, Issue 4, July 2002, Pages: 483–506, Gabriel Istrate

    Version of Record online : 23 APR 2002, DOI: 10.1002/rsa.10028

  20. On the solution-space geometry of random constraint satisfaction problems

    Random Structures & Algorithms

    Volume 38, Issue 3, May 2011, Pages: 251–268, Dimitris Achlioptas, Amin Coja-Oghlan and Federico Ricci-Tersenghi

    Version of Record online : 29 MAR 2010, DOI: 10.1002/rsa.20323