Travelled to:1 × Denmark
1 × France
1 × Germany
1 × Spain
1 × Taiwan
2 × Canada
2 × United Kingdom
3 × Italy
5 × USA
Collaborated with:A.Tacchella M.Narizzano M.Maratea ∅ P.Marin A.Armando C.Castellini M.Y.Vardi F.Giunchiglia R.Sebastiani E.D.Rosa B.O'Sullivan D.Zambonin D.Angeletti A.Puddu S.Sabina I.P.Gent A.G.D.Rowley M.D.T.Lewis T.Schubert B.Becker F.Copty L.Fix R.Fraer G.Kamhi A.Cimatti E.M.Clarke M.Pistore M.Roveri
Talks about:procedur (6) sat (5) satisfi (4) decis (4) base (4) qbf (4) constraint (3) boolean (3) reason (3) structur (2)
Person: Enrico Giunchiglia
DBLP: Giunchiglia:Enrico
Facilitated 1 volumes:
EdContributed to:
20112010
20092009
2006
2005200420052003
20022001
20012001
2000
200019981996Wrote 20 papers:
- SAC-2011-RosaGO #problem #quality #satisfiability
- Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences (EDR, EG, BO), pp. 901–906.
- SAT-2010-GiunchigliaMN #effectiveness #equivalence #named #preprocessor #reasoning
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (EG, PM, MN), pp. 85–98.
- ICST-2009-AngelettiGNPS #analysis #automation #generative #testing
- Automatic Test Generation for Coverage Analysis of ERTMS Software (DA, EG, MN, AP, SS), pp. 303–306.
- SAT-2009-LewisMSNBG #distributed #named
- PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing (MDTL, PM, TS, MN, BB, EG), pp. 509–523.
- DATE-2006-GiunchigliaNT #quantifier
- Quantifier structure in search based procedures for QBFs (EG, MN, AT), pp. 812–817.
- ICLP-2005-GiunchigliaM #on the #satisfiability #set
- On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) (EG, MM), pp. 37–51.
- SAT-2004-ArmandoCGM #constraints #difference #satisfiability
- A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints (AA, CC, EG, MM), pp. 166–173.
- SAT-2004-GiunchigliaNT #reasoning
- QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 247–254.
- SAT-J-2004-ArmandoCGM05 #constraints #difference #satisfiability
- A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints (AA, CC, EG, MM), pp. 16–29.
- SAT-J-2004-GiunchigliaNT05 #reasoning
- QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 105–121.
- SAT-2003-GentGNRT #data type
- Watched Data Structures for QBF Solvers (IPG, EG, MN, AGDR, AT), pp. 25–36.
- CAV-2002-CimattiCGGPRST #model checking
- NuSMV 2: An OpenSource Tool for Symbolic Model Checking (AC, EMC, EG, FG, MP, MR, RS, AT), pp. 359–364.
- CAV-2001-CoptyFFGKTV #bound #industrial #model checking
- Benefits of Bounded Model Checking at an Industrial Setting (FC, LF, RF, EG, GK, AT, MYV), pp. 436–453.
- IJCAR-2001-GiunchigliaMTZ #heuristic #optimisation #satisfiability
- Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability (EG, MM, AT, DZ), pp. 347–363.
- IJCAR-2001-GiunchigliaNT #named #quantifier #satisfiability
- QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability (EG, MN, AT), pp. 364–369.
- SAT-2001-GiunchigliaNTV #library #performance #satisfiability #towards
- Towards an Efficient Library for SAT: a Manifesto (EG, MN, AT, MYV), pp. 290–310.
- CADE-2000-GiunchigliaT #development #framework #platform
- System Description: *SAT: A Platform for the Development of Modal Decision Procedures (EG, AT), pp. 291–296.
- KR-2000-Giunchiglia #concurrent #constraints #nondeterminism #satisfiability
- Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism (EG), pp. 657–666.
- KR-1998-GiunchigliaGST #evaluation #logic
- More Evaluation of Decision Procedures for Modal Logics (EG, FG, RS, AT), pp. 626–635.
- KR-1996-Giunchiglia #calculus
- Determining Ramifications in the Situation Calculus (EG), pp. 76–86.