Travelled to:
1 × France
1 × Portugal
1 × Spain
2 × Denmark
2 × Italy
2 × USA
Collaborated with:
S.Baselice ∅ C.Lutz N.Olivetti G.Criscuolo F.Wolter M.Gelfond J.L.D.Coi D.Olmedilla L.Sauro A.Murano M.Y.Vardi S.Adali M.L.Sapino V.S.Subrahmanian
Talks about:
program (6) logic (4) circumscript (2) recurs (2) decid (2) preliminari (1) autoepistem (1) constraint (1) framework (1) subclass (1)
Person: Piero A. Bonatti
DBLP: Bonatti:Piero_A=
Contributed to:
Wrote 12 papers:
- ICLP-J-2010-BaseliceB #decidability #source code #subclass
- A decidable subclass of finitary programs (SB, PAB), pp. 481–496.
- ICLP-2008-BaseliceB #source code
- Composing Normal Programs with Function Symbols (SB, PAB), pp. 425–439.
- ICLP-2008-BonattiCOS #privacy #security #trust
- Policy-Driven Negotiations and Explanations: Exploiting Logic-Programming for Trust Management, Privacy & Security (PAB, JLDC, DO, LS), pp. 779–784.
- ICLP-2007-BaseliceBC #on the #recursion #source code
- On Finitely Recursive Programs (SB, PAB, GC), pp. 89–103.
- ICALP-v2-2006-BonattiLMV #calculus #complexity #μ-calculus
- The Complexity of Enriched μ-Calculi (PAB, CL, AM, MYV), pp. 540–551.
- KR-2006-BonattiLW #logic
- Description Logics with Circumscription (PAB, CL, FW), pp. 400–410.
- ICLP-2005-BaseliceBG #constraints #integration #set #theorem proving #towards
- Towards an Integration of Answer Set and Constraint Solving (SB, PAB, MG), pp. 52–66.
- PODS-2004-Bonatti #datalog #decidability #on the #query #recursion
- On the Decidability of Containment of Recursive Datalog Queries — Preliminary report (PAB), pp. 297–306.
- ICLP-2002-Bonatti #infinity #modelling #reasoning #source code
- Reasoning with Infinite Stable Models II: Disjunctive Programs (PAB), pp. 333–346.
- SIGMOD-1998-AdaliBSS #algebra #multi
- A Multi-Similarity Algebra (SA, PAB, MLS, VSS), pp. 402–413.
- CSL-1997-BonattiO #calculus
- A Sequent Calculus for Circumscription (PAB, NO), pp. 98–114.
- JICSLP-1992-Bonatti #framework #logic #logic programming #semantics #source code
- Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs (PAB), pp. 417–430.