Searching for authors named Marco Cadoli – sorted by Relevance.
-
A Survey of Complexity Results for Planning
- A Survey of Complexity Results for Planning *** DRAFT. COMMENTS VERY WELCOME *** Marco Cadoli
- Add To MetaCart
-
Proposal-based negotiation in convex regions
- -based negotiation in convex regions Marco Cadoli Dipartimento di Informatica e Sistemistica Università di Roma “La
- Cited by 1 (0 self) – Add To MetaCart
-
Panel on "Knowledge Compilation and Approximation": Terminology, Questions, References
- Panel on "Knowledge Compilation and Approximation": Terminology, Questions, References Marco
- Cited by 8 (0 self) – Add To MetaCart
-
Semantical and Computational Aspects of Horn Approximations
- Semantical and Computational Aspects of Horn Approximations Marco Cadoli Dipartimento di
- Cited by 28 (4 self) – Add To MetaCart
-
The Complexity of Model Checking for Circumscriptive Formulae
- The Complexity of Model Checking for Circumscriptive Formulae Marco Cadoli Dipartimento di
- Cited by 48 (5 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
- `a di Roma "La Sapienza" via Salaria 113, 00198 Roma, Italia schaerf@(email omitted); Marco Cadoli
- 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

