Sfoglia per Autore
A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics
2000-01-01 Giunchiglia, Enrico; Tacchella, Armando
Getting to the airport: The oldest planning problem in AI
2000-01-01 Lifschitz, V.; Mccain, N.; Remolina, E.; Tacchella, Armando
SAT vs. Translation based decision procedures for modal logics: a comparative evaluation
2000-01-01 Giunchiglia, Enrico; Giunchiglia, A.; Sebastiani, R.; Tacchella, Armando
Backjumping for Quantified Boolean Logic Satisfiability
2001-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
A Subset-matching Size-bounded Cache for Testing Satisfiability in Modal Logics
2001-01-01 Giunchiglia, Enrico; Tacchella, Armando
An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability
2001-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability.
2001-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
Improvements to SAT-based conformant planning
2001-01-01 Castellini, Claudio; Giunchiglia, Enrico; Tacchella, Armando
Towards an Efficient Library for SAT: a Manifesto
2001-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando; M. Y., Vardi
Evaluating search heuristics and optimization techniques in propositional satisfiability
2001-01-01 Giunchiglia, Enrico; Maratea, Marco; Tacchella, Armando; Zambonin, Davide
Benefits of bounded model checking at an industrial setting
2001-01-01 Copty, F.; Fix, L.; Fraer, R.; Giunchiglia, Enrico; Kamhi, G.; Tacchella, Armando; Vardi, M. Y.
SAT-Based Decision Procedures for Classical Modal Logics
2002-01-01 Giunchiglia, Enrico; Giunchiglia, F.; Tacchella, Armando
Dependent and Independent Variables in Propositional Satisfiability
2002-01-01 Giunchiglia, Enrico; Maratea, Marco; Tacchella, Armando
Learning for Quantified Boolean Logic Satisfiability
2002-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
2002-01-01 Cimatti, A; Clarke, E; Giunchiglia, Enrico; Giunchiglia, F; Pistore, M; Roveri, M; Sebastiani, R; Tacchella, Armando
Backjumping for Quantified Boolean Logic satisfiability
2003-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
Watched Data Structures for QBF Solvers
2003-01-01 I. P., Gent; Giunchiglia, Enrico; Narizzano, Massimo; A. G. D., Rowley; Tacchella, Armando
(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver
2003-01-01 Giunchiglia, Enrico; Maratea, Marco; Tacchella, Armando
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
2003-01-01 Castellini, C.; Giunchiglia, Enrico; Tacchella, Armando
QuBE++: An efficient QBF solver
2004-01-01 Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics | 1-gen-2000 | Giunchiglia, Enrico; Tacchella, Armando | |
Getting to the airport: The oldest planning problem in AI | 1-gen-2000 | Lifschitz, V.; Mccain, N.; Remolina, E.; Tacchella, Armando | |
SAT vs. Translation based decision procedures for modal logics: a comparative evaluation | 1-gen-2000 | Giunchiglia, Enrico; Giunchiglia, A.; Sebastiani, R.; Tacchella, Armando | |
Backjumping for Quantified Boolean Logic Satisfiability | 1-gen-2001 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando | |
A Subset-matching Size-bounded Cache for Testing Satisfiability in Modal Logics | 1-gen-2001 | Giunchiglia, Enrico; Tacchella, Armando | |
An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability | 1-gen-2001 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando | |
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. | 1-gen-2001 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando | |
Improvements to SAT-based conformant planning | 1-gen-2001 | Castellini, Claudio; Giunchiglia, Enrico; Tacchella, Armando | |
Towards an Efficient Library for SAT: a Manifesto | 1-gen-2001 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando; M. Y., Vardi | |
Evaluating search heuristics and optimization techniques in propositional satisfiability | 1-gen-2001 | Giunchiglia, Enrico; Maratea, Marco; Tacchella, Armando; Zambonin, Davide | |
Benefits of bounded model checking at an industrial setting | 1-gen-2001 | Copty, F.; Fix, L.; Fraer, R.; Giunchiglia, Enrico; Kamhi, G.; Tacchella, Armando; Vardi, M. Y. | |
SAT-Based Decision Procedures for Classical Modal Logics | 1-gen-2002 | Giunchiglia, Enrico; Giunchiglia, F.; Tacchella, Armando | |
Dependent and Independent Variables in Propositional Satisfiability | 1-gen-2002 | Giunchiglia, Enrico; Maratea, Marco; Tacchella, Armando | |
Learning for Quantified Boolean Logic Satisfiability | 1-gen-2002 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando | |
NuSMV 2: An OpenSource Tool for Symbolic Model Checking | 1-gen-2002 | Cimatti, A; Clarke, E; Giunchiglia, Enrico; Giunchiglia, F; Pistore, M; Roveri, M; Sebastiani, R; Tacchella, Armando | |
Backjumping for Quantified Boolean Logic satisfiability | 1-gen-2003 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando | |
Watched Data Structures for QBF Solvers | 1-gen-2003 | I. P., Gent; Giunchiglia, Enrico; Narizzano, Massimo; A. G. D., Rowley; Tacchella, Armando | |
(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver | 1-gen-2003 | Giunchiglia, Enrico; Maratea, Marco; Tacchella, Armando | |
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism | 1-gen-2003 | Castellini, C.; Giunchiglia, Enrico; Tacchella, Armando | |
QuBE++: An efficient QBF solver | 1-gen-2004 | Giunchiglia, Enrico; Narizzano, Massimo; Tacchella, Armando |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile