Automatic proof generation in kleene algebra

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

Volumn 4988 LNCS, Issue , 2008, Pages 382-396

  Worthington, James ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

AUTOMATIC PROOF GENERATION; BASIC THEORY; DETERMINIZATION; EQUATIONAL THEORY; KLEENE ALGEBRAS; PROOF SYSTEM; STANDARD CONSTRUCTIONS;

ALGEBRA;

EID: 67650380866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78913-0_28     Document Type: Conference Paper

References (9)

1. Cohen, E.: Hypotheses in Kleene Algebra. Technical Report TM-ARH-023814, Bellcore (1993), http://citeseer.ist.psu.edu/1688.html
2. Fitting, M.: Bisimulations and Boolean Vectors. Advances in Modal Logic 4, 97-125 (2003)
3. Kozen, D.: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Infor. and Comput 110(2), 366-390 (1994)
4. Kozen, D., Smith, F.: Kleene Algebra with Tests: Completeness and Decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 224-259. Springer, Heidelberg (1997)
5. Kozen, D.: Automata and Computability. In: Undergraduate Texts in Computer Science. Springer, Heidelberg (1997)
6. Kozen, D.: Typed Kleene Algebra. Technical Report 98-1669, Computer Science Department, Cornell University (March 1998)
7. Kozen, D.: On Hoare Logic and Kleene Algebra with Tests. Trans. Computational Logic 1(1), 60-76 (2000)
8. Stockmeyer, L.J., Meyer, A.R.: Word Problems Requiring Exponential Time. In: Proc. 5th Symp. Theory of Computing, pp. 1-9 (1973)
9. Worthington, J.: Feasibly Reducing KAT Equations to KA Equations, http://arxiv.org/abs/0801.2368