The following pages link to Paolo Liberatore (Q202172):
Displaying 40 items.
- On the complexity of extension checking in default logic (Q844157) (← links)
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- (Q1575184) (redirect page) (← links)
- The complexity of belief update (Q1575185) (← links)
- Conditional independence in propositional logic. (Q1852858) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- On the complexity of choosing the branching literal in DPLL (Q1978252) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Consistency defaults (Q2454638) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- Bijective faithful translations among default logics (Q2937692) (← links)
- The Size of BDDs and Other Data Structures in Temporal Logics Model Checking (Q2985265) (← links)
- Monotonic reductions, representative equivalence, and compilation of intractable problems (Q3196627) (← links)
- Seminormalizing a default theory (Q3647232) (← links)
- (Q4411161) (← links)
- (Q4506459) (← links)
- (Q4536337) (← links)
- (Q4654271) (← links)
- Uncontroversial Default Logic (Q4659508) (← links)
- (Q4796540) (← links)
- Belief Integration and Source Reliability Assessment (Q4963215) (← links)
- Revision by History (Q5176855) (← links)
- Complexity results on DPLL and resolution (Q5277743) (← links)
- Compilability of propositional abduction (Q5277767) (← links)
- Where fail-safe default logics fail (Q5277775) (← links)
- Belief Merging by Examples (Q5277910) (← links)
- AI*IA 2005: Advances in Artificial Intelligence (Q5475738) (← links)
- Representability in Default Logic (Q5697720) (← links)
- On the complexity of case-based planning (Q5704532) (← links)
- Complexity and compilability of diagnosis and recovery of graph-based systems (Q5706510) (← links)
- (Q5715663) (← links)
- Compilability and compact representations of revision of Horn knowledge bases (Q5738901) (← links)
- Belief revision and update: Complexity of model checking (Q5943121) (← links)
- Mixed Iterated Revisions: Rationale, Algorithms, and Complexity (Q6116365) (← links)
- Reconstructing a single-head formula to facilitate logical forgetting (Q6189217) (← links)
- The ghosts of forgotten things: a study on size after forgetting (Q6560989) (← links)
- Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)
