Automating proofs of integrity constraints in situation calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1079, Issue , 1996, Pages 212-222

  Bertossi, Leopoldo ^a   Pinto, Javier ^a   Saez, Pablo ^a   Kapur, Deepak ^b   Subramaniam, Mahadevan ^b  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; INTEGRATED CIRCUITS; INTELLIGENT DATABASES; INTELLIGENT SYSTEMS; SEMANTICS; SPECIFICATIONS;

AUTOMATED SUPPORT; FRAME PROBLEMS; INITIAL STATE; INTEGRITY CONSTRAINTS; RELATIONAL DATA; REWRITE RULES; SITUATION CALCULUS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84949806797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61286-6_146     Document Type: Conference Paper

References (15)

1. L. Bertossi and J. Ferretti. SCDBR: A Reasoner for Specifications in the Situation Calculus of Database Updates. In Temporal Logic. Proc. First Intl. Conf. ICTL '94, Bonn, Germany, July 1994, LNAI 827, 543-545, Springer.
2. L. Bertossi, J. Pinto, P. Saez, D. Kapur, and M. Subramaniam. Automated Proofs of Integrity Constraints in Situation Calculus. Technical Report, Computer Science Dept., SUNY, Albany, Nov. 1995.
3. R.S. Boyer and J S. Moore. A Computational Logic Handbook. AP, 1988.
4. R.S. Boyer and J S. Moore. The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover. Journal of Automated Reasoning, 4:117-172, 1988.
5. D. Kapur. Constructors can be Partial too. Dept. of Computer Science, State University of New York at Albany, 1994.
6. D. Kapur and H. Zhang. An Overview of Rewrite Rule Laboratory (RRL). J. of Computer and Mathematics with Applications, 1995.
7. J. McCarthy and P. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. In B. Meltzer and D. Michie, eds, Machine Intelligence, vol. 4, 463-502, Edinburgh, Scotland, 1969. Edinburgh University Press.
8. R. Reiter. Towards a Logical Reconstruction of Relational Databases Theory. In J. Mylopoulos and J. Schmidt. eds. On Conceptual Modeling: Perspectives from AI, Databases and Programming Languages, 191-233. Springer-Verlag, 1984.
9. R. Reiter. The Frame Problem in the Situation Calculus: a Simple" Solution (sometimes) and a Completeness Result for Goal Regression. In V. Lifschitz, ed, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, 359-380. Academic Press, 1991.
10. R. Reiter. Formalizing Database Evolution in the Situation Calculus. In Proceedings of the Fifth Generation Computer Systems, Tokyo, Japan, June 1992.
11. R. Reiter. On Specifying Database Updates. Technical Report KRR-TR-92-3, University of Toronto, Department of Computer Science, Toronto, Canada, 1992.
12. R. Reiter. Proving Properties of States in the Situation Calculus. Artificial Intelligence, 64(2):337-351, 1993.
13. T. Sheard and D. Stemple. Automatic Verification of Database Transaction Safety. TR 88-29, Dept. Computer and Information Science, U. Mass., Amherst, MA, 1988.
14. H. Zhang and D. Kapur. First-Order Theorem Proving using Conditional Rewrite Rules. In Lusk and Overbeek, eds., Proc. 9th Intl. Conf. on Automated Deduction (CADE-9), LNCS 310, 1-20. Springer, 1988.
15. H. Zhang, D. Kapur, and M.S. Krishnamoorthy. A Mechanizable Induction Principle for Equational Specifications. In Lusk and Overbeek, eds, Proc. 9th Intl. Conf. on Automated Deduction (CADE-9), LNCS 310, 162-181. Springer, 1988.