Search

Your search keyword '"Conjunctive normal form"' showing total 2,327 results

Search Constraints

Start Over You searched for: Descriptor "Conjunctive normal form" Remove constraint Descriptor: "Conjunctive normal form" Publication Year Range Last 50 years Remove constraint Publication Year Range: Last 50 years
2,327 results on '"Conjunctive normal form"'

Search Results

1. DAG-: A DAG-Based Sigma Protocol for Relations in CNF

2. Diagnoser design strategy for discrete event system: Case study of neutralization system.

3. 混合 exactly - one 约束的模型计数研究.

5. First-order Predicate Logic

6. Extensible Datasort Refinements

7. Skolem Function Continuation for Quantified Boolean Formulas

8. Compressibility and Probabilistic Proofs

9. Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity

10. Conjunctive Abstract Interpretation Using Paramodulation

12. The complete set of minimal simple graphs that support unsatisfiable 2-CNFs.

13. On conversions from CNF to ANF.

14. On weak positive predicates over a finite set.

15. Space-Consistent Game Equivalence Detection in General Game Playing

18. Introduction and Basic concepts

19. Decision Procedures for Propositional Logic

21. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

22. Bit-Vector Optimization

23. Fixed-Point Elimination in the Intuitionistic Propositional Calculus

25. A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic

26. A Survey of Satisfiability Modulo Theory

27. On Incremental Core-Guided MaxSAT Solving

28. Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm

29. Dependency Schemes in QBF Calculi: Semantics and Soundness

30. On Finding Minimum Satisfying Assignments

31. ABT with Clause Learning for Distributed SAT

32. Satisfiability Checking: Theory and Applications

33. OpenSMT2: An SMT Solver for Multi-core and Cloud Computing

34. Lifting QBF Resolution Calculi to DQBF

35. Dependency Schemes for DQBF

36. Non-prenex QBF Solving Using Abstraction

37. 2QBF: Challenges and Solutions

38. On Q-Resolution and CDCL QBF Solving

39. MCS Extraction with Sublinear Oracle Queries

40. nanoCoP: A Non-clausal Connection Prover

41. Super-Blocked Clauses

42. The Next Whisky Bar

43. On the Quantile Cut Closure of Chance-Constrained Problems

44. The Picat-SAT Compiler

45. Advancing Software Model Checking Beyond Linear Arithmetic Theories

46. Formula Slicing: Inductive Invariants from Preconditions

47. Writing Declarative Specifications for Clauses

48. Sudoku Colorings of a 16-Cell Pre-fractal

49. Efficient SAT-Based Pre-image Enumeration for Quantitative Information Flow in Programs

50. Skolem Functions for DQBF

Catalog

Books, media, physical & digital resources