Searching for authors named "Paolo Liberatore" – sorted by Relevance.
-
On the complexity of choosing the branching literal in DPLL
- On the Complexity of Choosing the Branching Literal in DPLL 1 Introduction Paolo Liberatore
- Cited by 5 (0 self) – Add To MetaCart
-
On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc.
- On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc. Paolo
- Cited by 4 (2 self) – Add To MetaCart
-
Compilability of domain descriptions in the language A
- .ida.liu.se/ext/etai/rac/notes/1997/13/ Compilability of Domain Descriptions in the Language A Paolo Liberatore University of Rome \La
- Cited by 1 (0 self) – Add To MetaCart
-
The Complexity of Belief Update
- The Complexity of Belief Update Paolo Liberatore Dipartimento di Informatica e Sistemistica
- Cited by 17 (0 self) – Add To MetaCart
-
Complexity results on DPLL and resolution
- Complexity Results on DPLL and Resolution PAOLO LIBERATORE Università diRoma“LaSapienza” DPLL
- Cited by 1 (0 self) – Add To MetaCart
-
Redundancy in logic I: CNF propositional formulae
- arXiv:cs/0211031v1 [cs.AI] 22 Nov 2002 Redundancy in Logic I: CNF Propositional Formulae Paolo
- Cited by 1 (0 self) – Add To MetaCart
-
The Complexity of Checking Redundancy of CNF Propositional Formulae
- The Complexity of Checking Redundancy of CNF Propositional Formulae Paolo Liberatore 1 Abstract
- Cited by 2 (0 self) – Add To MetaCart
-
Compact Representations of Revision of Horn Clauses
- Compact Representations of Revision of Horn Clauses Paolo Liberatore Universit`a di Roma "La
- Cited by 6 (5 self) – Add To MetaCart
-
The Complexity of Iterated Belief Revision
- The Complexity of Iterated Belief Revision Paolo Liberatore Universit`a di Roma "La Sapienza
- Cited by 15 (2 self) – Add To MetaCart
-
Recommended citation:
- The Complexity of the Language A Paolo Liberatore Dipartimento di Informatica e Sistemistica University of Rome
- Add To MetaCart

