Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Piero A. Bonatti

Papers on DiSC'04


On the Decidability of Containment of Recursive Datalog Queries - Preliminary report

Publications


Note: Links lead to the DBLP on the Web.

Piero A. Bonatti

Piero A. Bonatti, P. Festa : On optimal service selection. WWW 2005 : 530-538

Jennifer Golbeck , Piero A. Bonatti, Wolfgang Nejdl , Daniel Olmedilla , Marianne Winslett : Proceedings of the ISWC*04 Workshop on Trust, Security, and Reputation on the Semantic Web, Hiroshima, Japan, November 7, 2004 Technical University of Aachen (RWTH) 2004

Piero A. Bonatti: Abduction over Unbounded Domains via ASP. ECAI 2004 : 288-292

Piero A. Bonatti: On the Decidability of Containment of Recursive Datalog Queries - Preliminary report. PODS 2004 : 297-306

Joachim Biskup , Piero A. Bonatti: Controlled Query Evaluation for Known Policies by Combining Lying and Refusal. Ann. Math. Artif. Intell. 40 (1-2): 37-62 (2004)

Piero A. Bonatti: Reasoning with infinite stable models. Artif. Intell. 156 (1): 75-111 (2004)

Piero A. Bonatti, Adriano Peron : On the undecidability of logics with converse, nominals, recursion and counting. Artif. Intell. 158 (1): 75-96 (2004)

Joachim Biskup , Piero A. Bonatti: Controlled query evaluation for enforcing confidentiality in complete information systems. Int. J. Inf. Sec. 3 (1): 14-27 (2004)

Piero A. Bonatti: Finitary Open Logic Program. Answer Set Programming 2003

Piero A. Bonatti: On the Undecidability of Description and Dynamic Logics with Recursion and Counting. IJCAI 2003 : 331-336

Piero A. Bonatti, Yu Deng , V. S. Subrahmanian : An Ontology-Extended Relational Algebra. IRI 2003 : 192-199

Piero A. Bonatti, Pierangela Samarati : Logics for Authorization and Security. Logics for Emerging Applications of Databases 2003 : 277-323

Piero A. Bonatti, Sarit Kraus , V. S. Subrahmanian : Secure Agents. Ann. Math. Artif. Intell. 37 (1-2): 169-235 (2003)

Joachim Biskup , Piero A. Bonatti: Confidentiality Policies and Their Enforcement for Controlled Query Evaluation. ESORICS 2002 : 39-54

Joachim Biskup , Piero A. Bonatti: Controlled Query Evaluation for Known Policies by Combining Lying and Refusal. FoIKS 2002 : 49-66

Piero A. Bonatti: Reasoning with Infinite Stable Models II: Disjunctive Programs. ICLP 2002 : 333-346

Piero A. Bonatti: Towards Service Description Logics. JELIA 2002 : 74-85

Piero A. Bonatti: Abduction, ASP and open logic programs. NMR 2002 : 184-190

Piero A. Bonatti, Nicola Olivetti : Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Log. 3 (2): 226-278 (2002)

Piero A. Bonatti, Sabrina De Capitani di Vimercati , Pierangela Samarati : An algebra for composing access control policies. ACM Trans. Inf. Syst. Secur. 5 (1): 1-35 (2002)

Piero A. Bonatti: Abduction, ASP and Open Logic Programs CoRR cs.AI/0207021 : (2002)

Piero A. Bonatti, Pierangela Samarati : A Uniform Framework for Regulating Service Access and Information Release on the Web. Journal of Computer Security 10 (3): 241-272 (2002)

Piero A. Bonatti, Ernesto Damiani , Sabrina De Capitani di Vimercati , Pierangela Samarati : A Component-Based Architecture for Secure Data Publication. ACSAC 2001 : 309-318

Piero A. Bonatti: Reasoning with infinite stable models. IJCAI 2001 : 603-610

Piero A. Bonatti: Reasoning with Open Logic Programs. LPNMR 2001 : 147-159

Piero A. Bonatti: Prototypes for Reasoning with Infinite Stable Models and Function Symbols. LPNMR 2001 : 416-419

Piero A. Bonatti, Ernesto Damiani , Sabrina De Capitani di Vimercati , Pierangela Samarati : An Access Control Model for Data Archives. SEC 2001 : 261-276

Elisa Bertino , Piero A. Bonatti, Elena Ferrari : TRBAC: A temporal role-based access control model. ACM Trans. Inf. Syst. Secur. 4 (3): 191-233 (2001)

Joachim Biskup , Piero A. Bonatti: Lying versus refusal for known potential secrets. Data Knowl. Eng. 38 (2): 199-222 (2001)

Piero A. Bonatti: Resolution for Skeptical Stable Model Semantics. J. Autom. Reasoning 27 (4): 391-421 (2001)

V. S. Subrahmanian , Piero A. Bonatti, Jürgen Dix , Thomas Eiter , Sarit Kraus , Fatma Ozcan , Robert Ross : Heterogenous Active Agents MIT Press 2000

Piero A. Bonatti, Pierangela Samarati : Regulating service access and information release on the Web. ACM Conference on Computer and Communications Security 2000 : 134-143

Piero A. Bonatti, Sabrina De Capitani di Vimercati , Pierangela Samarati : A modular approach to composing access control policies. ACM Conference on Computer and Communications Security 2000 : 164-173

Elisa Bertino , Piero A. Bonatti, Elena Ferrari : TRBAC: a temporal role-based access control model. ACM Workshop on Role-Based Access Control 2000 : 21-30

Elisa Bertino , Piero A. Bonatti, Elena Ferrari , Maria Luisa Sapino : Temporal Authorization Bases: From Specification to Integration. Journal of Computer Security 8 (4): (2000)

Elisa Bertino , Piero A. Bonatti, Elena Ferrari , Maria Luisa Sapino : Specifying and computing hierarchies of temporal authorizations. APPIA-GULP-PRODE 1999 : 243-258

Elisa Bertino , Piero A. Bonatti, Elena Ferrari , Maria Luisa Sapino : Specifying and Computing Hierarchies of Temporal Authorizations. DBSec 1999 : 285-300

Piero A. Bonatti, Sarit Kraus , Jose Salinas , V. S. Subrahmanian : Data-Security in Heterogeneous Agent Systems. CIA 1998 : 290-305

Sibel Adali , Piero A. Bonatti, Maria Luisa Sapino , V. S. Subrahmanian : A Multi-Similarity Algebra. SIGMOD Conference 1998 : 402-413

Piero A. Bonatti: A Constructive Negation for Transition System Specifications. APPIA-GULP-PRODE 1997 : 283-294

Piero A. Bonatti, Nicola Olivetti : A Sequent Calculus for Circumscription. CSL 1997 : 98-114

Piero A. Bonatti: Resolution for Skeptical Stable Semantics. LPNMR 1997 : 185-197

Piero A. Bonatti, Nicola Olivetti : A Sequent Calculus for Skeptical Default Logic. TABLEAUX 1997 : 107-121

Piero A. Bonatti, Maria Luisa Sapino , V. S. Subrahmanian : Merging Heterogeneous Security Orderings. Journal of Computer Security 5 (1): 3-30 (1997)

Piero A. Bonatti, Maria Luisa Sapino , V. S. Subrahmanian : Merging Heterogeneous Security Orderings. ESORICS 1996 : 183-197

Piero A. Bonatti: Sequent Calculi for Default and Autoepistemic Logics. TABLEAUX 1996 : 127-142

Piero A. Bonatti, Thomas Eiter : Querying Disjunctive Databases Through Nonmonotonic Logics. Theor. Comput. Sci. 160 (1&2): 321-363 (1996)

Piero A. Bonatti, Laura Giordano : Three-Valued Semantics for Extended Logic Programs. GULP-PRODE 1995 : 295-306

Piero A. Bonatti, Thomas Eiter : Querying Disjunctive Database Through Nonmonotonic Logics. ICDT 1995 : 68-81

Piero A. Bonatti, Sarit Kraus , V. S. Subrahmanian : Foundations of Secure Deductive Databases. IEEE Trans. Knowl. Data Eng. 7 (3): 406-422 (1995)

Piero A. Bonatti: A Three-Valued Formalization of Provability. J. Log. Comput. 5 (2): 173-201 (1995)

Piero A. Bonatti: Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs. J. Log. Program. 22 (2): 91-149 (1995)

Piero A. Bonatti: Autoepistemic Logic Programming. J. Autom. Reasoning 13 (1): 35-67 (1994)

Piero A. Bonatti: Autoepistemic Logic Programming. LPNMR 1993 : 151-167

Piero A. Bonatti, Sarit Kraus , V. S. Subrahmanian : Declarative Foundations of Secure Deductive Databases. ICDT 1992 : 391-406

Piero A. Bonatti: Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs. JICSLP 1992 : 417-430

Piero A. Bonatti: Model Theoretic Semantics for Demo. META 1992 : 220-234

Piero A. Bonatti: A Family of Three-Valued Autoepistemic Logics. AI*IA 1991 : 28-37

Piero A. Bonatti: Beliefs as Stable Conjectures. LPNMR 1991 : 53-68

Piero A. Bonatti: A More General Solution to the Multiple Expansion Problem. LPNMR 1990 : 10-18

1 [ 22 ]

2 [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 33 ]

3 [ 32 ] [ 46 ] [ 47 ] [ 53 ] [ 56 ]

4 [ 34 ] [ 38 ]

5 [ 50 ]

6 [ 30 ]

7 [ 12 ] [ 14 ] [ 30 ]

8 [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 33 ]

9 [ 60 ]

10 [ 13 ]

11 [ 59 ]

12 [ 6 ] [ 11 ] [ 23 ] [ 30 ] [ 48 ]

13 [ 59 ]

14 [ 18 ] [ 20 ] [ 42 ]

15 [ 59 ]

16 [ 30 ]

17 [ 54 ]

18 [ 30 ]

19 [ 23 ]

20 [ 28 ] [ 29 ] [ 34 ] [ 38 ] [ 39 ] [ 41 ] [ 49 ]

21 [ 16 ] [ 17 ] [ 22 ] [ 24 ] [ 25 ] [ 26 ]

22 [ 6 ] [ 11 ] [ 16 ] [ 17 ] [ 22 ] [ 23 ] [ 30 ] [ 48 ] [ 50 ]

23 [ 28 ] [ 34 ] [ 38 ] [ 41 ]

24 [ 59 ]




©2005 Association for Computing Machinery