This site uses cookies. Some of these cookies are essential to the operation of the site, while others help to improve your experience by providing insights into how the site is being used. For more information, please see the ProZ.com privacy policy.
Cookie settings
  1. KudoZ™ Top
  2. English to Arabic
  3. Computers: Systems, Networks

ٍِSAٍT solver

Arabic translation: برامج حل مسألة وجود تفسير يحقق / يستوفي معادلة منطقية

GLOSSARY ENTRY (DERIVED FROM QUESTION BELOW)
English term or phrase:ٍِSAٍT solver
Arabic translation:برامج حل مسألة وجود تفسير يحقق / يستوفي معادلة منطقية
Entered by: ProZAli

15:22 Nov 20, 2016
English to Arabic translations [PRO]
Tech/Engineering - Computers: Systems, Networks
English term or phrase: ٍِSAٍT solver
SAT solvers are entities that try to find a solution for SAT problems in an efficient time. The main types of SAT solvers are: Davis-Putnam-Logemann-Loveland procedure (DPLL) based solvers, Stochastic Local Search (SLS) solvers, and Parallel SAT solvers.
Houda Nashawi
United States
Local time: 22:08
برامج حل مسألة وجود تفسير يحقق / يستوفي معادلة منطقية
Explanation:
In computer science, the Boolean Satisfiability Problem (sometimes called Propositional Satisfiability Problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable.
Selected response from:

ProZAli
United Kingdom
Local time: 03:08
Grading comment
Thank you!
4 KudoZ points were awarded for this answer



Summary of answers provided
3 +2حلال اختبارات السات
Yosra Montasser
5برامج حل مسألة وجود تفسير يحقق / يستوفي معادلة منطقية
ProZAli


  

Answers


6 mins   confidence: Answerer confidence 3/5Answerer confidence 3/5 peer agreement (net): +2
حلال اختبارات السات


Explanation:
00

Yosra Montasser
Egypt
Local time: 05:08
Native speaker of: Native in ArabicArabic, Native in EnglishEnglish

Peer comments on this answer (and responses from the answerer)
agree  S.J
4 mins
agree  adel saad
1 hr
Login to enter a peer comment (or grade)

22 mins   confidence: Answerer confidence 5/5
ٍِsaٍt solver
برامج حل مسألة وجود تفسير يحقق / يستوفي معادلة منطقية


Explanation:
In computer science, the Boolean Satisfiability Problem (sometimes called Propositional Satisfiability Problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable.


    https://en.wikipedia.org/wiki/Boolean_satisfiability_problem
ProZAli
United Kingdom
Local time: 03:08
Native speaker of: Native in ArabicArabic
PRO pts in category: 4
Grading comment
Thank you!
Login to enter a peer comment (or grade)



Login or register (free and only takes a few minutes) to participate in this question.

You will also have access to many other tools and opportunities designed for those who have language-related jobs (or are passionate about them). Participation is free and the site has a strict confidentiality policy.

Return to KudoZ list

KudoZ™ translation help

The KudoZ network provides a framework for translators and others to assist each other with translations or explanations of terms and short phrases.

See also:
ProZ.com term search
Search millions of term translations
Close search
Term search
  • All of ProZ.com
  • Term search
  • Jobs
  • Forums
  • Multiple search