Paolo Ferraris - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2012

2011

Logic programs with propositional connectives and aggregatesPaolo Ferraris. tocl, 12(4):25, 2011. [doi]

Stable models and circumscriptionPaolo Ferraris, Joohyung Lee, Vladimir Lifschitz. ai, 175(1):236-263, 2011. [doi]

On the Minimality of Stable ModelsPaolo Ferraris, Vladimir Lifschitz. BIRTHDAY 2011: 64-73 [doi]

2009

Symmetric Splitting in the General Theory of Stable ModelsPaolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla. IJCAI 2009: 797-803 [doi]

2007

Propositional theories are strongly equivalent to logic programsPedro Cabalar, Paolo Ferraris. tplp, 7(6):745-759, 2007. [doi]

Forgetting Actions in Domain DescriptionsEsra Erdem, Paolo Ferraris. AAAI 2007: 409-414

A Logic Program Characterization of Causal TheoriesPaolo Ferraris. IJCAI 2007: 366-371 [doi]

A New Perspective on Stable ModelsPaolo Ferraris, Joohyung Lee, Vladimir Lifschitz. IJCAI 2007: 372-379 [doi]

2006

Causal Theories as Logic ProgramsPaolo Ferraris. wlp 2006: 35-44 [doi]

A generalization of the Lin-Zhao theoremPaolo Ferraris, Joohyung Lee, Vladimir Lifschitz. AMAI, 47(1-2):79-101, 2006. [doi]

2005

Answer Sets for Propositional TheoriesPaolo Ferraris. lpnmr 2005: 119-131 [doi]

On Modular Translations and Strong EquivalencePaolo Ferraris. lpnmr 2005: 79-91 [doi]

Weight constraints as nested expressionsPaolo Ferraris, Vladimir Lifschitz. tplp, 5(1-2):45-74, 2005. [doi]

Mathematical Foundations of Answer Set ProgrammingPaolo Ferraris, Vladimir Lifschitz. BIRTHDAY 2005: 615-664

2004

Almost Definite Causal TheoriesSemra Dogandag, Paolo Ferraris, Vladimir Lifschitz. lpnmr 2004: 74-86 [doi]

2000

Planning as Satisfiability in Nondeterministic DomainsPaolo Ferraris, Enrico Giunchiglia. AAAI 2000: 748-753

Sign in or sign up to see more results.

runs on WebDSL