Sfoglia per Autore
Size of a revised knowledge base
1995 Cadoli, Marco; Donini Francesco, M.; Liberatore, Paolo; Schaerf, Marco
Feasibility and unfeasibility of off-line processing
1996 Cadoli, Marco; Donini, F.; Liberatore, Paolo; Schaerf, Marco
The complexity of model checking for belief revision and update
1996 Liberatore, Paolo; Schaerf, Marco
The complexity of belief update
1997 Liberatore, P.
Reducing belief revision to circumscription (and vice versa)
1997 Liberatore, Paolo; Schaerf, Marco
The complexity of model checking for propositional default logics
1998 Liberatore, Paolo; Schaerf, Marco
Arbitration (or how to merge knowledge bases)
1998 Liberatore, Paolo; Schaerf, Marco
The size of a revised knowledge base
1999 Cadoli, Marco; Donini, F. M.; Liberatore, Paolo; Schaerf, Marco
Compilability of abduction
2000 Liberatore, Paolo; Schaerf, Marco
The complexity of belief update
2000 Liberatore, Paolo
Compilability and compact representations of revision of Horn knowledge bases
2000 Liberatore, Paolo
On the complexity of choosing the branching literal in DPLL
2000 Liberatore, Paolo
Space efficiency of propositional knowledge representation formalisms
2000 Cadoli, Marco; F. M., Donini; Liberatore, Paolo; Schaerf, Marco
BReLS: A system for the integration of knowledge bases
2000 Liberatore, Paolo; Schaerf, Marco
A framework for belief update
2000 Liberatore, Paolo
Belief revision and update: Complexity of model checking
2001 Liberatore, Paolo; Schaerf, Marco
Monotonic reductions, representative equivalence, and compilation of intractable problems
2001 Liberatore, Paolo
Solving QBF by SMV
2002 Donini, F; Liberatore, Paolo; Massacci, F; Schaerf, Marco
Preprocessing of intractable problems
2002 Cadoli, Marco; Francesco M., Donini; Liberatore, Paolo; Schaerf, Marco
The size of MDP factored policies
2002 Liberatore, Paolo
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