Elisa Bertino
Barbara Catania
- AL91.M. Ayel and J.P. Laurent, editors. Validatzon, Verification and Test of Knowledge-Based Systems. Chichester, UK: Wiley, 1991. Google Scholar
Digital Library
- AV87.S. Abiteboul and V. Vianu. A Transaction Language Complete for Database Updates and Specification. In Proc. of the 7th A CM Symposzum on Prznciples of Database Systems, San Diego, California, 1987. Google ScholarDigital Library
- BC95.E. Bertino and B. Catania. Static Analysis of Logical Languages with Deferred Update Semantics. Technical Report n. 159-96, Dipartimento di Scienze dell'Informazione, University of Milano, Italy.Google Scholar
- BCGM94.E. Bertino, B. Catania, G. Guerrini, and D. Montesi. Transaction Optimization in Rule Databases. In Proc. of the #th Int. Workshop on Research Issues in Data Engineering, RIDE'9#, pages 137-145, Houston, Texas, 1994.Google ScholarCross Ref
- BGL91.A. Bossi, M. Gabbrielli, G. Levi, and M.C. Meo. Contributions to the Semantics of Open Logic Programs. In Proc. of the Int. Conf. on Fifth Generation Computer Systems, pages 570-580, 1992. Google ScholarDigital Library
- BK94.A.J. Bonner and M. Kifer. An Overview of Transaction Logic. Theoretical Computer Science, I33:205-265, 1994. Google ScholarDigital Library
- BMM92.E. Bertino, M. Martelli, and D. Montesi. Modeling Database Updates with Constraint Logic Programming. In Proc.of the $th International Workshop on Foundations of Models and Languages for Data and Objects: Modehng Database Dynamics, Volkse, Germany, 1992. Google ScholarDigital Library
- DMP93.M. Deft, S. Morishita, and G. Phipps. Design and Implementation of the Glue-Nail Database System. In Proc. of the A CM SIGMOD Int. Conf. on Management of Data, pages 147-167, Washington, DC, 1993. Google ScholarDigital Library
- JL87.J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. of the I#th Annual A CM Syrup. on Principles of Programming Languages, pages 111-119, New York, USA, 1987. Google ScholarDigital Library
- KNZ89.R. Krishnamurthy, S. Naqvi, and C. Zaniolo. Database Transactions in /2731;. In Proc. of the North Amerzcan Conference, pages 795-815, 1989.Google Scholar
- Levy93.A.Y. Levy. Irrelevance Reasoning in Knowledge Based Systems. Ph. D. Thesis, Department of Computer Science, Stanford University, Stanford, California, 1993. Also Report n. STAN-CS-93-1482, Stanford University, Stanford, California. Google ScholarDigital Library
- LMSS93.A.Y. Levy, I.S. Mumick, Y. Sagiv, and O. Shmueli. Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. In Proc. of the 12th ACM Symposium on Princzples of Database Systems, pages 109-122, Washington DC, 1993. Google ScholarDigital Library
- LS92.A. Levy and Y. Sagiv. Constraints and Redundancy in Datalog. In Proc. of the 11th A CM Symposium on Principles of Database Systems, pages 67-80, San Diego, California, 1992. Google ScholarDigital Library
- LS93.C. Laasch and M.H. Scholl. Deterministic Semantics of Set-Oriented Update Sequences. In Proc. of the Int. Conf. on Data Engineering, pages 4-13, 1993. Google ScholarDigital Library
- Shmu87.O. Shmueli. Decidability and Expressiveness Aspects of Logic Queries. In Proc. of the 7th A CM Symposium on Principles of Database Systems, pages 237-249, San Diego, California, 1987. Google ScholarDigital Library
- Shmu93.O. Shmueli. Equivalence of Datalog Queries is Undecidable. Journal of Logic Programmzng, 15:231-241, 1993. Google ScholarDigital Library
- ST90.O. Shmueli and S. Tsur. Logical Diagnosis of ~73~ Programs. In Proc. of the 7th Int. Conf. on Logic Programming, 1989. Google ScholarDigital Library
- Ull89.J.D. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1989. Google ScholarDigital Library
- ZN94.Du. Zhang and Doan Nguyen. PREPARE: A Tool for Knowledge Base Verification. IEEE Transactions on Knowledge and Data Engineering, 6(6): 983-989, 1994. Google ScholarDigital Library
Index Terms
- Static analysis of intensional databases in U-Datalog (extended abstract)
Recommendations
Static analysis in datalog extensions
We consider the problems of containment, equivalence, satisfiability and query-reachability for datalog programs with negation. These problems are important for optimizing datalog programs. We show that both query-reachability and satisfiability are ...
Abstract Hilbertian deductive systems, infon logic, and Datalog
In the first part of the paper, we discuss abstract Hilbertian deductive systems; these are systems defined by abstract notions of formula, axiom, and inference rule. We use these systems to develop a general method for converting derivability problems, ...
Datalog LITE: a deductive query language with linear time model checking
We present Datalog LITE, a new deductive query language with a linear-time model-checking algorithm, that is, linear time data complexity and program complexity. Datalog LITE is a variant of Datalog that uses stratified negation, restricted variable ...
Comments