Polite theories revisited

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

Volumn 6397 LNCS, Issue , 2010, Pages 402-416

  Jovanović, Dejan ^a   Barrett, Clark ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

BIT VECTOR; DECISION PROCEDURE;

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS;

EID: 85037533414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16242-8_29     Document Type: Conference Paper

References (13)

1. Barrett, C., Shikanian, I., Tinelli, C.: An abstract decision procedure for a theory of inductive data types. Journal on Satisfiability, Boolean Modeling and Computation 3, 21-46 (2007)
2. Enderton, H.B.: A mathematical introduction to logic. Academic Press, New York (1972)
3. Jovanović, D., Barrett, C.: Polite theories revisited. Technical Report TR2010-922, Department of Computer Science, New York University (January 2010)
4. Krstić, S., Goel, A., Grundy, J., Tinelli, C.: Combined Satisfiability Modulo Parametric Theories. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 602-617. Springer, Heidelberg (2007) (Pubitemid 350259324)
5. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979)
6. Oppen, D.C.: Complexity, convexity and combinations of theories. Theoretical Computer Science 12(3), 291-302 (1980)
7. Ranise, S., Ringeissen, C., Zarba, C.: Combining Data Structures with Nonstably Infinite Theories using Many-Sorted Logic. Research Report RR-5678, INRIA (2005)
8. Ranise, S., Ringeissen, C., Zarba, C.G.: Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 48-64. Springer, Heidelberg (2005)
9. Stump, A., Dill, D.L., Barrett, C.W., Levitt, J.: A decision procedure for an extensional theory of arrays. In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS 2001), June 2001, pp. 29-37. IEEE Computer Society, Boston (June 2001) (Pubitemid 32795615)
10. Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Frontiers of Combining Systems. Applied Logic, pp. 103-120. Kluwer Academic Publishers, Dordrecht (1996)
11. Tinelli, C., Zarba, C.: Combining decision procedures for sorted theories. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 641-653. Springer, Heidelberg (2004) (Pubitemid 41049970)
12. Tinelli, C., Zarba, C.: Combining decision procedures for theories in sorted logics. Technical Report 04-01, Department of Computer Science, The University of Iowa (February 2004)
13. Tinelli, C., Zarba, C.G.: Combining nonstably infinite theories. Journal of Automated Reasoning 34(3), 209-238 (2005)