Sfoglia per Autore
Approximate entailment
1991 Cadoli, M.; Schaerf, M.
A SURVEY OF COMPLEXITY RESULTS FOR NONMONOTONIC LOGICS
1993 Cadoli, Marco; Schaerf, Marco
Approximate Inference in Default Logic and Circumscription
1994 Cadoli, Marco; Schaerf, Marco
Is intractability of non-monotonic reasoning a real drawback?
1994 Cadoli, Marco; Donini Francesco, M.; Schaerf, Marco
Tractable Reasoning via Approximation
1995 Schaerf, Marco; Cadoli, Marco
Size of a revised knowledge base
1995 Cadoli, Marco; Donini Francesco, M.; Liberatore, Paolo; Schaerf, Marco
On compact representations of propositional circumscription
1995 Cadoli, M.; Donini, F. M.; Schaerf, M.
Feasibility and unfeasibility of off-line processing
1996 Cadoli, Marco; Donini, F.; Liberatore, Paolo; Schaerf, Marco
Is intractability of nonmonotonic reasoning a real drawback?
1996 Cadoli, Marco; Francesco M., Donini; Schaerf, Marco
On the complexity of entailment in propositional multivalued logics
1996 Cadoli, Marco; Schaerf, Marco
Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae
1997 Cadoli, M.; Giovanardi, A.; Schaerf, M.
Default logic as a query language
1997 Cadoli, Marco; Thomas, Eiter; Georg, Gottlob
A survey on knowledge compilation
1997 Cadoli, Marco; FRANCESCO M., Donini
On Compact Representations of Propositional Circumscription
1997 Cadoli, Marco; Donini, Fm; Schaerf, Marco; Silvestri, Riccardo
Using abstract resources to control reasoning
1998 RICHARD W., Weyhrauch; Cadoli, Marco; CAROLYN L., Talcott
Circumscribing datalog: expressive power and complexity
1998 Cadoli, Marco; Luigi, Palopoli
Esercizi di progettazione di programmi in C++
1998 Cadoli, Marco; Lenzerini, Maurizio; Panizzi, Emanuele; Andrea, Schaerf
Algorithm to evaluate Quantified Boolean Formulae
1998 Cadoli, Marco; Giovanardi, Andrea; Schaerf, Marco
Using LPNMR for problem specification and code generation
1999 Cadoli, Marco
Propositional lower bounds: Algorithms and complexity
1999 Cadoli, Marco; Luigi, Palopoli; Francesco, Scarcello
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Approximate entailment | 1991 | Cadoli, M.; Schaerf, M. | |
A SURVEY OF COMPLEXITY RESULTS FOR NONMONOTONIC LOGICS | 1993 | Cadoli, Marco; Schaerf, Marco | |
Approximate Inference in Default Logic and Circumscription | 1994 | Cadoli, Marco; Schaerf, Marco | |
Is intractability of non-monotonic reasoning a real drawback? | 1994 | Cadoli, Marco; Donini Francesco, M.; Schaerf, Marco | |
Tractable Reasoning via Approximation | 1995 | Schaerf, Marco; Cadoli, Marco | |
Size of a revised knowledge base | 1995 | Cadoli, Marco; Donini Francesco, M.; Liberatore, Paolo; Schaerf, Marco | |
On compact representations of propositional circumscription | 1995 | Cadoli, M.; Donini, F. M.; Schaerf, M. | |
Feasibility and unfeasibility of off-line processing | 1996 | Cadoli, Marco; Donini, F.; Liberatore, Paolo; Schaerf, Marco | |
Is intractability of nonmonotonic reasoning a real drawback? | 1996 | Cadoli, Marco; Francesco M., Donini; Schaerf, Marco | |
On the complexity of entailment in propositional multivalued logics | 1996 | Cadoli, Marco; Schaerf, Marco | |
Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae | 1997 | Cadoli, M.; Giovanardi, A.; Schaerf, M. | |
Default logic as a query language | 1997 | Cadoli, Marco; Thomas, Eiter; Georg, Gottlob | |
A survey on knowledge compilation | 1997 | Cadoli, Marco; FRANCESCO M., Donini | |
On Compact Representations of Propositional Circumscription | 1997 | Cadoli, Marco; Donini, Fm; Schaerf, Marco; Silvestri, Riccardo | |
Using abstract resources to control reasoning | 1998 | RICHARD W., Weyhrauch; Cadoli, Marco; CAROLYN L., Talcott | |
Circumscribing datalog: expressive power and complexity | 1998 | Cadoli, Marco; Luigi, Palopoli | |
Esercizi di progettazione di programmi in C++ | 1998 | Cadoli, Marco; Lenzerini, Maurizio; Panizzi, Emanuele; Andrea, Schaerf | |
Algorithm to evaluate Quantified Boolean Formulae | 1998 | Cadoli, Marco; Giovanardi, Andrea; Schaerf, Marco | |
Using LPNMR for problem specification and code generation | 1999 | Cadoli, Marco | |
Propositional lower bounds: Algorithms and complexity | 1999 | Cadoli, Marco; Luigi, Palopoli; Francesco, Scarcello |
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