Quantifier elimination and provers integration

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 1, 2003, Pages 22-34

  Ghilardi, Silvio ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

Combination; Fusion; Model Completions; Nelson Oppen Combination Schema; Quantifier Elimination; Superposition Calculus

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CONSTRAINT THEORY; FORMAL LOGIC; FUSION REACTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

COMBINATION; MODEL COMPLETIONS; NELSON-OPPEN COMBINATION SCHEMA; QUANTIFIER ELIMINATION; SUPERPOSITION CALCULUS;

AUTOMATA THEORY;

EID: 9444222109     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80650-9     Document Type: Conference Paper

References (19)

1. Armando A., Ranise S., Rusinowitch M., Uniform Derivation of Superposition Based Decision Procedures, "Proceedings of the Annual Conference on Computer Science Logic" (CSL01), Paris, France, pp. 513-527, (2001).
2. Baader F., Tinelli C., Combining Decision Procedures for Positive Theories Sharing Constructors, in Sophie Tison (ed.) "Rewriting Techniques and Applications", 13th International Conference (RTA02), Springer LNCS 2378, pp. 352-366, (2002).
3. Bachmair L., Ganzinger H. Equational Reasoning in Saturation-Based Theorem Proving. Bibel L., Schmitt P.H. "Automated Deduction - A Basis for Applications", vol. I. 1998;353-397 Kluwer
4. Chang C.C., Keisler H.J. Model Theory. IIIrd edition:1990;North Holland
5. Ferrante J., Rackoff C.W., The Computational Complexity of Logical Theories, Springer Lecture Notes in Mathematics 718, (1979).
6. Ghilardi S., Reasoners Cooperation and Quantifier Elimination, Rapporto Interno n. 288-03, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano (2003).
7. Ghilardi S., Santocanale L., Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logic, preprint (2003).
8. Ghilardi S., Zawadowski M. Sheaves, Games and Model Completions. Trends in Logic Series. 2002;Kluwer
9. Janicic̀ P., Bundy A. A General Setting for Flexibly Combining and Augmenting Decision Procedures. Journal of Automated Reasoning. 28:2002;257-305
10. MacIntyre A. Model Completeness. Barwise J. "Handbook of Mathematical Logic" 1977;139-180 North Holland
11. Nelson G., Oppen D. Simplification by Cooperating Decision Procedures. ACM Transactions on Programming Languages and Systems. 1:(2):1979;245-257
12. Nieuwhenhuis R., Rubio A. Paramodulation-Based Theorem Proving. Robinson A., Voronkov A. "Handbook of Automated Reasoning", vol. I. 2001;371-533 Elsevier/MIT
13. Oppen D. Complexity, Convexity and Combination of Theories. Theoretical Computer Science. 12:1980;291-302
14. Oppen D. Reasoning about Recursively Defined Data Structures. Journal of the ACM. 27:(3):1980;403-411
15. Tinelli C. Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing. Journal of Automated Reasoning. 2003;. (to appear)
16. Tinelli C., Harandi M. A New Correctness Proof of the Nelson-Oppen Combination Procedure. Baader F., Schulz K. "1st International Workshop on Frontiers of Combining Systems (FroCos'96)", Applied Logic Series, vol. 3. 1996;103-120 Kluwer Academic Publishers
17. Tinelli C., Ringeissen C. Unions of Non-Disjoint Theories and Combination of Satisfiability Procedures. Theoretical Computer Science. 290:(1):2003;291-353
18. Wheeler W.H. Model-Companions and Definability in Existentially Complete Structures. Israel Journal of Mathematics. 25:1976;305-330
19. Wolter F. Fusions of Modal Logics Revisited. Kracht M., Rijke De M., Wansing H., Zakharyaschev M. "Advances in Modal Logic" 1998;CSLI, Stanford