Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("TACCHELLA, Armando")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 53

  • Page / 3
Export

Selection :

  • and

Challenges in the QBF arena: The SAT'03 evaluation of QBF solversLE BERRE, Daniel; SIMON, Laurent; TACCHELLA, Armando et al.Lecture notes in computer science. 2004, pp 468-485, issn 0302-9743, isbn 3-540-20851-8, 18 p.Conference Paper

Theory and applications of satisfiability testing (Santa Margherita Ligure, 5-8 May 2003, selected revised papers)Giunchiglia, Enrico; Tacchella, Armando.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-20851-8, XI, 530 p, isbn 3-540-20851-8Conference Proceedings

Watched data structures for QBF solversGENT, Ian; GIUNCHIGLIA, Enrico; NARIZZANO, Massimo et al.Lecture notes in computer science. 2004, pp 25-36, issn 0302-9743, isbn 3-540-20851-8, 12 p.Conference Paper

Monotone literals and learning in QBF reasoningGIUNCHIGLIA, Enrico; NARIZZANO, Massimo; TACCHELLA, Armando et al.Lecture notes in computer science. 2004, pp 260-273, issn 0302-9743, isbn 3-540-23241-9, 14 p.Conference Paper

An analysis of backjumping and trivial truth in quantified boolean formulas satisfiabilityGIUNCHIGLIA, Enrico; NARIZZANO, Massimo; TACCHELLA, Armando et al.Lecture notes in computer science. 2001, pp 111-122, issn 0302-9743, isbn 3-540-42601-9Conference Paper

The QBFEVAL web portalNARIZZANO, Massimo; PULINA, Luca; TACCHELLA, Armando et al.Lecture notes in computer science. 2006, pp 494-497, issn 0302-9743, isbn 3-540-39625-X, 1Vol, 4 p.Conference Paper

A self-adaptive multi-engine solver for quantified Boolean formulasPULINA, Luca; TACCHELLA, Armando.Constraints (Dordrecht). 2009, Vol 14, Num 1, pp 80-116, issn 1383-7133, 37 p.Article

(IN)Effectiveness of look-ahead techniques in a modern SAT solverGIUNCHIGLIA, Enrico; MARATEA, Marco; TACCHELLA, Armando et al.Lecture notes in computer science. 2003, pp 842-846, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

An algorithm for SAT above the thresholdHUBIE CHEN.Lecture notes in computer science. 2004, pp 14-24, issn 0302-9743, isbn 3-540-20851-8, 11 p.Conference Paper

Survey and Belief Propagation on random k-SATBRAUNSTEIN, Alfredo; ZECCHINA, Riccardo.Lecture notes in computer science. 2004, pp 519-528, issn 0302-9743, isbn 3-540-20851-8, 10 p.Conference Paper

kcnfs: An efficient solver for random k-SAT formulaeDEQUEN, Gilles; DUBOIS, Olivier.Lecture notes in computer science. 2004, pp 486-501, issn 0302-9743, isbn 3-540-20851-8, 16 p.Conference Paper

A study of Pure Random Walk on random satisfiability problems with physical methodsSEMERJIAN, Guilhem; MONASSON, Rémi.Lecture notes in computer science. 2004, pp 120-134, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

Cache performance of SAT solvers: A case study for efficient implementation of algorithmsLINTAO ZHANG; MALIK, Sharad.Lecture notes in computer science. 2004, pp 287-298, issn 0302-9743, isbn 3-540-20851-8, 12 p.Conference Paper

On computing k-CNF formula propertiesWILLIAMS, Ryan.Lecture notes in computer science. 2004, pp 330-340, issn 0302-9743, isbn 3-540-20851-8, 11 p.Conference Paper

Hypergraph reductions and satisfiability problemsPRETOLANI, Daniele.Lecture notes in computer science. 2004, pp 383-397, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

Conflict-based selection of branching rulesHERBSTRITT, Marc; BECKER, Bernd.Lecture notes in computer science. 2004, pp 441-451, issn 0302-9743, isbn 3-540-20851-8, 11 p.Conference Paper

An extensible SAT-solverEEN, Niklas; SÖRENSSON, Niklas.Lecture notes in computer science. 2004, pp 502-518, issn 0302-9743, isbn 3-540-20851-8, 17 p.Conference Paper

Local search on SAT-encoded colouring problemsPRESTWICH, Steven.Lecture notes in computer science. 2004, pp 105-119, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

On the probabilistic approach to the random satisfiability problemPARISI, Giorgio.Lecture notes in computer science. 2004, pp 203-213, issn 0302-9743, isbn 3-540-20851-8, 11 p.Conference Paper

How good can a resolution based SAT-solver be?GOLDBERG, Eugene; NOVIKOV, Yakov.Lecture notes in computer science. 2004, pp 37-52, issn 0302-9743, isbn 3-540-20851-8, 16 p.Conference Paper

On fixed-parameter tractable parameterizations of SATSZEIDER, Stefan.Lecture notes in computer science. 2004, pp 188-202, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

Computing vertex eccentricity in exponentially large graphs: QBF formulation and solutionMNEIMNEH, Maher; SAKALLAH, Karem.Lecture notes in computer science. 2004, pp 411-425, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

Effective preprocessing with hyper-resolution and equality reductionBACCHUS, Fahiem; WINTER, Jonathan.Lecture notes in computer science. 2004, pp 341-355, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

Solving error correction for large data sets by means of a SAT solverBRUNI, Renato.Lecture notes in computer science. 2004, pp 229-241, issn 0302-9743, isbn 3-540-20851-8, 13 p.Conference Paper

The combinatorics of conflicts between clausesKULLMANN, Oliver.Lecture notes in computer science. 2004, pp 426-440, issn 0302-9743, isbn 3-540-20851-8, 15 p.Conference Paper

  • Page / 3