Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
Preprocessing of intractable problems
Information and Computation
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Model Checking and Preprocessing
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Disjunctive merging: Quota and Gmin merging operators
Artificial Intelligence
Artificial Intelligence
A syntactical approach to qualitative constraint networks merging
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Foundations of instance level updates in expressive description logics
Artificial Intelligence
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
On the succinctness of some modal logics
Artificial Intelligence
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |