Answer sets for propositional theories P Ferraris International Conference on Logic Programming and Nonmonotonic Reasoning …, 2005 | 243 | 2005 |

Stable models and circumscription P Ferraris, J Lee, V Lifschitz Artificial Intelligence 175 (1), 236-263, 2011 | 185 | 2011 |

Weight constraints as nested expressions P Ferraris, V Lifschitz Theory and Practice of Logic Programming 5 (1-2), 45-74, 2005 | 170 | 2005 |

A New Perspective on Stable Models. P Ferraris, J Lee, V Lifschitz IJCAI 7, 372-379, 2007 | 159 | 2007 |

Propositional theories are strongly equivalent to logic programs P Cabalar, P Ferraris Theory and Practice of Logic Programming 7 (6), 745-759, 2007 | 91 | 2007 |

Planning as satisfiability in nondeterministic domains P Ferraris, E Giunchiglia AAAI/IAAI, 748-753, 2000 | 74 | 2000 |

Mathematical Foundations of Answer Set Programming. P Ferraris, V Lifschitz We will show them!(1), 615-664, 2005 | 67 | 2005 |

Logic programs with propositional connectives and aggregates P Ferraris ACM Transactions on Computational Logic (TOCL) 12 (4), 1-40, 2011 | 64 | 2011 |

Symmetric splitting in the general theory of stable models P Ferraris, J Lee, V Lifschitz, R Palla Twenty-First International Joint Conference on Artificial Intelligence, 2009 | 63 | 2009 |

A generalization of the Lin-Zhao theorem P Ferraris, J Lee, V Lifschitz Annals of Mathematics and Artificial Intelligence 47 (1), 79-101, 2006 | 58 | 2006 |

On the stable model semantics of first-order formulas with aggregates P Ferraris, V Lifschitz Proceedings of International Workshop on Nonmonotonic Reasoning (NMR), 2010 | 26 | 2010 |

Representing first-order causal theories by logic programs P Ferraris, J Lee, Y Lierler, V Lifschitz, F Yang Theory and Practice of Logic Programming 12 (3), 383-412, 2012 | 22 | 2012 |

Forgetting actions in domain descriptions E Erdem, P Ferraris AAAI 7, 409-414, 2007 | 15 | 2007 |

Almost definite causal theories S Doğandağ, P Ferraris, V Lifschitz International Conference on Logic Programming and Nonmonotonic Reasoning, 74-86, 2004 | 15 | 2004 |

A Logic Program Characterization of Causal Theories. P Ferraris IJCAI 7, 366-371, 2007 | 13 | 2007 |

On the minimality of stable models P Ferraris, V Lifschitz Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 64-73, 2011 | 7 | 2011 |

On modular translations and strong equivalence P Ferraris International Conference on Logic Programming and Nonmonotonic Reasoning, 79-91, 2005 | 6 | 2005 |

Causal Theories as Logic Programs. P Ferraris WLP, 35-44, 2006 | 3 | 2006 |

Planning as satisfiability in simple nondeterministc domains P Ferraris, E Guinchiglia AIPS-Workshop on Model-Theoretic Approaches to Planning, 10-17, 2000 | 3 | 2000 |

Expressiveness of answer set languages P Ferraris The University of Texas at Austin, 2007 | 1 | 2007 |