The following pages link to Marco Schaerf (Q202173):
Displaying 25 items.
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Reasoning about reasoning in a meta-level architecture (Q1183375) (← links)
- On the complexity of entailment in propositional multivalued logics (Q1380415) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation (Q1610666) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- (Q2751045) (← links)
- The Size of BDDs and Other Data Structures in Temporal Logics Model Checking (Q2985265) (← links)
- Negation and minimality in disjunctive databases (Q3125092) (← links)
- A survey of complexity results for non-monotonic logics (Q4275256) (← links)
- (Q4298365) (← links)
- (Q4506459) (← links)
- On compact representations of propositional circumscription (Q4596622) (← links)
- (Q4654271) (← links)
- (Q4835906) (← links)
- Compilability of propositional abduction (Q5277767) (← links)
- (Q5428936) (← links)
- AI*IA 2005: Advances in Artificial Intelligence (Q5475738) (← links)
- (Q5518824) (← links)
- (Q5623334) (← links)
- Belief revision and update: Complexity of model checking (Q5943121) (← links)
