Paolo Ferraris, Ph.D.
Affiliations: | 2007 | Computer Sciences | University of Texas at Austin, Austin, Texas, U.S.A. |
Area:
Computer ScienceGoogle:
"Paolo Ferraris"Parents
Sign in to add mentorVladimir Lifschitz | grad student | 2007 | UT Austin | |
(Expressiveness of answer set languages.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Ferraris P, Lee J, Lierler Y, et al. (2012) Representing first-order causal theories by logic programs Theory and Practice of Logic Programming. 12: 383-412 |
Ferraris P. (2011) Logic programs with propositional connectives and aggregates Acm Transactions On Computational Logic. 12 |
Ferraris P, Lifschitz V. (2011) On the minimality of stable models Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6565: 64-73 |
Ferraris P, Lee J, Lifschitz V. (2010) Stable models and circumscription Artificial Intelligence. 175: 236-263 |
Cabalar P, Ferraris P. (2007) Propositional theories are strongly equivalent to logic programs Theory and Practice of Logic Programming. 7: 745-759 |
Ferraris P. (2007) A logic program characterization of causal theories Ijcai International Joint Conference On Artificial Intelligence. 366-371 |
Erdem E, Ferraris P. (2007) Forgetting actions in domain descriptions Proceedings of the National Conference On Artificial Intelligence. 1: 409-414 |
Ferraris P, Lee J, Lifschitz V. (2007) A new perspective on stable models Ijcai International Joint Conference On Artificial Intelligence. 372-379 |
Ferraris P, Lee J, Lifschitz V. (2006) A generalization of the Lin-Zhao theorem Annals of Mathematics and Artificial Intelligence. 47: 79-101 |
Ferraris P. (2006) Causal theories as logic programs Proceedings of the 20th Workshop On Logic Programming, Wlp 2006. 35-44 |