Searching for authors named Marco Schaerf – sorted by Relevance.
-
Negation And Minimality In Disjunctive Databases
- J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 NEGATION AND MINIMALITY IN DISJUNCTIVE DATABASES MARCO
- Cited by 3 (0 self) – Add To MetaCart
-
Logic Programming and Autoepistemic Logics: New Relations and Complexity Results
- Logic Programming and Autoepistemic Logics: New Relations and Complexity Results ? Marco Schaerf
- Cited by 6 (1 self) – Add To MetaCart
-
On the Complexity of Entailment in Propositional Multivalued Logics
- On the Complexity of Entailment in Propositional Multivalued Logics Marco Cadoli Marco Schaerf
- Cited by 9 (0 self) – Add To MetaCart
-
Approximate Inference in Default Logic and Circumscription
- Approximate Inference in Default Logic and Circumscription y Marco Cadoli, Marco Schaerf
- Cited by 7 (0 self) – Add To MetaCart
-
A Survey on Complexity Results for Non-monotonic Logics
- A Survey on Complexity Results for Non-monotonic Logics Marco Cadoli, Marco Schaerf Dipartimento
- Cited by 75 (5 self) – Add To MetaCart
-
Tractable Reasoning via Approximation
- Tractable Reasoning via Approximation y Marco Schaerf Istituto di Elettrotecnica Universit`a di
- Cited by 73 (0 self) – Add To MetaCart
-
Compiling Problem Specifications into SAT
- Compiling Problem Specifications into SAT Marco Cadoli 1 and Andrea Schaerf 2 1 Dipartimento di
- Cited by 19 (7 self) – Add To MetaCart
-
Compilability of Abduction
- Compilability of Abduction Paolo Liberatore and Marco Schaerf Dipartimento di Informatica e
- Cited by 2 (0 self) – Add To MetaCart
-
Relating Belief Revision and Circumscription
- Relating Belief Revision and Circumscription Paolo Liberatore and Marco Schaerf Dipartimento di
- Cited by 6 (3 self) – Add To MetaCart
-
The Complexity of Model Checking for Propositional Default Logics
- The Complexity of Model Checking for Propositional Default Logics Paolo Liberatore and Marco
- Cited by 5 (1 self) – Add To MetaCart

