Results 11 to 20 of about 235,564 (296)
Underestimation vs Overestimation in SAT-based Planning [PDF]
, 2013 Planning as satisfiability is one of the main approaches to finding parallel optimal solution plans for classical planning problems. Existing high performance SAT-based planners are able to exploit either forward or backward search strategy; starting ...
Chrpa, Lukáš +2 more
core +4 more sources
New width parameters for SAT and #SAT
Artificial Intelligence, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Ganian, Stefan Szeider
openaire +3 more sources
Complexity of Max-SAT using stochastic algorithms [PDF]
, 2008 Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems. Also, it has been used either by itself or in combination with other methods to solve the most difficult region of SAT, the phase transition.
Prugel-Bennett, Adam, Qasem, Mohamed
core +2 more sources
SAT-IT: The Interactive SAT Tracer
, 2023 In this work we present the Interactive SAT Tracer (SAT-IT), a visual and interactive tool to monitor and illustrate the basic algorithms for solving the Boolean Satisfiability Problem (SAT). We consider three algorithms with progressively increasing sophistication: simple backtracking, its extension with unit-propagation, so called Davis-Putnam ...
Marc Cané +3 more
openaire +1 more source
Minimizing counterexample with Unit Core Extraction and Incremental SAT [PDF]
, 2005 It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample minimization algorithm.
Qin, Ying +5 more
core +2 more sources
Computing preferred extensions in abstract argumentation : a SAT based approach [PDF]
, 2013 This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances.
Vallati, Mauro +8 more
core +2 more sources
A Fast Counterexample Minimization Approach with Refutation Analysis and Incremental SAT [PDF]
, 2005 It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minimization algorithm compared to all other approaches, but its run time overhead ...
Qin, Ying, Li, SiKun, Shen, ShengYu
core +2 more sources
A pearl on SAT solving in Prolog [PDF]
, 2010 A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant use of Prolog constructs is presented ...
Howe, J. M. +5 more
core +1 more source
International Journal of Emergency Medicine, 2008 A 61-year-old man presented to the emergency department (ED) with sudden onset shortness of breath, coughing paroxysms, and a brief loss of consciousness. The emergency medical services (EMS) noted the patient to be diaphoretic and unresponsive, with a prior history of single lung transplantation.
Schears, Raquel M., Hess, Jamie M.
openaire +2 more sources
LSTM-ANN based DTC of Induction Motor with 5 Level Inverter [PDF]
E3S Web of ConferencesMedium voltage drives especially induction motor drives are mostly using in industries for many applications. The precious intelligent control of induction motors are high required in nuclear power generation units.
Singh Satendra +3 more
doaj +1 more source