Keywords: رضایتمندی; Data Mining; Association rules; Satisfiability;
مقالات ISI رضایتمندی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: رضایتمندی; Network reliability; Tensor networks; Satisfiability; Counting; Boolean logic; Quantum computing;
Keywords: رضایتمندی; Temporal logic; Model checking; Satisfiability; Verification;
Keywords: رضایتمندی; Temporal logic; Visibly pushdown languages; Satisfiability; Model checking; Infinite games;
Keywords: رضایتمندی; Semidefinite programming; Satisfiability; Minimal unsatisfiability; Farkas' Lemma; Semidefinite least squares;
Keywords: رضایتمندی; Configuration Management; Variety Management; Satisfiability
Keywords: رضایتمندی; Temporal logics; Data variable quantifications; Satisfiability; Model checking; Decidability and complexity; Alternating register automata; Data automata;
Keywords: رضایتمندی; Satisfiability; NP-complete problem; Optimization; Geometric programming
Keywords: رضایتمندی; Justification logic; Computational complexity; Satisfiability
Keywords: رضایتمندی; ATPG; Test don't cares; Satisfiability; Symbolic simulation; Test compression; Embedded cores;
Keywords: رضایتمندی; Temporal logic; CTL⁎; Formal languages; Expressive power; Model checking; Satisfiability
Keywords: رضایتمندی; Grammar induction; Automata induction; Vertex coloring; Satisfiability; Identification in the limit
Keywords: رضایتمندی; Satisfiability; Implication; Inclusion dependencies; Data cleaning; Schema matching
Keywords: رضایتمندی; Satisfiability; SAT solver; SAT generator; Graph modularity
Keywords: رضایتمندی; Temporal logic; Concurrent recursive programs; Nested words; Mazurkiewicz traces; Satisfiability; Model checking
Keywords: رضایتمندی; Satisfiability; Constraint LTL; Bounded satisfiability checking
Q-learning for Markov decision processes with a satisfiability criterion
Keywords: رضایتمندی; Markov decision processes; Satisfiability; Q-learning; Replicator dynamics; Differential inclusions;
Gate elimination: Circuit size lower bounds and #SAT upper bounds
Keywords: رضایتمندی; Circuit complexity; Lower bounds; Exponential time algorithms; Satisfiability;
CTL* with graded path modalities
Keywords: رضایتمندی; Path quantifiers; Graded temporal logic; Satisfiability; Automata theoretic approach to verification;
Approximating Max NAE-k-SAT by anonymous local search
Keywords: رضایتمندی; Local search; Algorithm; Complexity; Performance ratio; Satisfiability;
The undecidability of arbitrary arrow update logic
Keywords: رضایتمندی; Modal logic; Dynamic epistemic logic; Update logics; Undecidability; Satisfiability;
A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming
Keywords: رضایتمندی; Generalized solution concepts; Super solutions; Satisfiability; Constraint satisfaction; Random instances; Probabilistic method; Threshold phenomena;
Success rates analysis of three hybrid algorithms on SAT instances
Keywords: رضایتمندی; Success rate; Markov chain; Heuristic algorithms; Hybrid algorithm; Time complexity; Satisfiability;
Backdoors into heterogeneous classes of SAT and CSP
Keywords: رضایتمندی; Constraint satisfaction; Satisfiability; Backdoor set; Parameterized complexity;
Hardware accelerated SAT solvers-A survey
Keywords: رضایتمندی; SAT; FPGA; Satisfiability; Boolean; Logic; NP complete;
Term satisfiability in FLew-algebras
Keywords: رضایتمندی; Substructural logic; FLew-algebra; MV-algebra; Satisfiability; Computational complexity;
Augmenting ATL with strategy contexts
Keywords: رضایتمندی; Temporal logics; Games for synthesis; Model checking; Satisfiability;
Complexity of two-variable dependence logic and IF-logic
Keywords: رضایتمندی; Dependence logic; Independence-friendly logic; Two-variable logic; Decidability; Complexity; Satisfiability; Expressivity
Boundary properties of the satisfiability problems
Keywords: رضایتمندی; Theory of computation; NP-completeness; Satisfiability; Boundary properties of graphs
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Keywords: رضایتمندی; Algorithms; Analysis of algorithms; Randomized algorithms; #k-SAT; Satisfiability
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
Keywords: رضایتمندی; Satisfiability; Resolution; Semidefinite relaxation
Complexity issues related to propagation completeness
Keywords: رضایتمندی; Boolean functions; Satisfiability; Knowledge compilation; Empowering implicates; Unit propagation; Propagation completeness
A constructive investigation of satisfiability
Keywords: رضایتمندی; 03F03; 03B20Intuitionistic logic; Sequent calculus; Satisfiability; Constructive mathematics
Generalized kk-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation
Keywords: رضایتمندی; Satisfiability; Mixed Horn formula; 2-CNF; Level graph; Planar embedding; Tanglegram; Crossing minimization; Graph drawing; Computational biology; Combinatorial optimization
Finding kernels or solving SAT
Keywords: رضایتمندی; Digraphs; Kernel; Satisfiability; Propositional logic
Estimating satisfiability
Keywords: رضایتمندی; Constraint satisfaction problem; Satisfiability; First moment method
The complexity of satisfiability for fragments of hybrid logic-Part I
Keywords: رضایتمندی; Hybrid logic; Satisfiability; Decidability; Complexity; Post's lattice;
Complexity of hybrid logics over transitive frames
Keywords: رضایتمندی; Hybrid logic; Satisfiability; Decidability; Complexity
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
Keywords: رضایتمندی; Artificial intelligence; Satisfiability; Max-SAT; Branch-and-bound; Tabu search
The SAT–UNSAT transition for random constraint satisfaction problems
Keywords: رضایتمندی; Random structures; Constraint satisfaction; Satisfiability; Phase transition; Sharp thresholds
Linear CNF formulas and satisfiability
Keywords: رضایتمندی; Linear CNF formula; Satisfiability; NP-completeness; Resolution; Latin square; Finite projective plane
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
Keywords: رضایتمندی; Branching rules; Conflict-based search frameworks; Satisfiability
Models and quantifier elimination for quantified Horn formulas
Keywords: رضایتمندی; Quantified Boolean formula; Quantified Horn formula; Model; Quantifier elimination; Satisfiability
Phase transitions of PP-complete satisfiability problems
Keywords: رضایتمندی; Phase transitions; Satisfiability; PP-complete
Differential approximation of min sat, max sat and related problems
Keywords: رضایتمندی; NP-hard optimization problems; Polynomial approximation; Differential approximation; Satisfiability; Minimum satisfiability; Maximum satisfiability;
Regular-SAT: A many-valued approach to solving combinatorial problems
Keywords: رضایتمندی; Combinatorial problem solving; Many-valued logic; Satisfiability; Solvers
The unsatisfiability threshold revisited
Keywords: رضایتمندی; Phase transition; Complexity; Satisfiability; Probabilistic analysis
Scalability of the surface-based DNA algorithm for 3-SAT
Keywords: رضایتمندی; DNA computing on surfaces; Satisfiability; 3-SAT
Order preserving reductions and polynomial improving paths
Keywords: رضایتمندی; Neighborhood functions; Discrete optimization; Computational complexity; Satisfiability
GridSAT: a system for solving satisfiability problems using a computational grid
Keywords: رضایتمندی; Parallel; Distributed; Scheduling; Satisfiability; Computational grid