Automated reasoning in some local extensions of ordered structures

Journal of Multiple-Valued Logic and Soft Computing

Volumn 13, Issue 4-6, 2007, Pages 397-413

  Sofronie Stokkermans, Viorica ^a   Ihlemann, Carsten ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Automated reasoning; G del algebras; Hierarchical reasoning; Lattice ordered structures; Monotone functions; MV algebras

Indexed keywords

ALGEBRA; CASE BASED REASONING; HIERARCHICAL SYSTEMS; NUMERICAL METHODS;

AUTOMATED REASONING; GODEL ALGEBRAS; HIERARCHICAL REASONING; LATTICE ORDERED STRUCTURES; MONOTONE FUNCTIONS; MV-ALGEBRAS;

LOGIC PROGRAMMING;

EID: 36348976337     PISSN: 15423980     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (30)

1. F. Baader. (2003). Terminological cycles in a description logic with existential restrictions. In G. Gottlob and T. Walsh, editors, Proc. 18th International Joint Conference on Artificial Intelligence, pp. 325-330. Morgan Kaufmann.
2. S. Burris. (1995). Polynomial time uniform word problems. Mathematical Logic Quarterly, 41:173-182.
3. C. C. Chang.(1958). Algebraic analysis of many-valued logics. Trans. Amer. Math. Soc., 88:467-490.
4. B. A. Davey and H. A. Priestley. (1990). Introduction to Lattices and Order. Cambridge University Press.
5. F. Esteva, J. Gispert, L. Godo, and F. Montagna. (2002). On the standard and rational completeness of some axiomatic extensions of the monoidal t-norm logic. Studia Logica, 71:199-226.
6. T. Evans. (1951). The word problem for abstract algebras. J. London Math. Soc., 28:64-71.
7. J. D. Farley. (1996). Priestley duality for order-preserving maps into distributive lattices. Order, 13:65-98.
8. H. Ganzinger. (2001). Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems. In Proc. 16th IEEE Symp. on Logic in Computer Science (LICS'OI), pp. 81-92. IEEE Comp. Soc. Press.
9. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. (2004). DPLL(T): Fast decision procedures. In R. Alur and D. Peled, editors, Proc. 16th International Conference on Computer Aided Verification (CAV'04), LNCS 3114, pp. 175-188. Springer.
10. J. Gispert and D. Mundici. (2005). MV-algebras: A variety for magnitudes with archimedean units. Algebra Universalis, 53:7-43.
11. R. Goldblatt. (1989). Varieties of complex algebras. Annals of Pure and Applied Logic, 44(3): 153-301.
12. R. Hähnle. (1994). Many-valued logic and mixed integer programming. Annals of Mathematics and Artificial Intelligence, 12(3,4):231- 264.
13. R. Hähnle. (1997). Proof theory of many-valued logic - linear optimization - logic design. Soft Computing-A Fusion of Foundations, Methodologies and Applications, 1(3): 107-119.
14. R. Hähnle. (2003). Complexity of many-valued logics. In M. Fitting and E. Ortowska, editors, Beyond Two: Theory and Applications of Multiple Valued Logic, volume 114 of Studies in Fuzziness and Soft Computing, chapter 3, pp. 211 -233. Springer, Berlin.
15. P. Hájek. (1998). Metamathematics of Fuzzy Logic. Trends in Logic, Volume 4. Kluwer Academic Publishers, Dordrecht.
16. C. Hartonas and J. M. Dunn. (1997). Stone duality for lattices. Algebra Universalis, 37(3):391-401.
17. E. Marchioni and F. Montagna. (To appear). Complexity and definability issues in Łπ1/2 Journal of Logic and Computation.
18. J. C. C. McKinsey. (1943). The decision problem for some classes of sentences without quantifiers. The Journal of Symbolic Logic, 8(3):61-76.
19. D. Mundici. (1987). Satisfiability of many-valued sentential logics is NP-complete. Theoretical Computer Science, 52:145-153.
20. H. A. Priestley. (1970). Representation of distributive lattices by means of ordered Stone spaces. Bull. London Math. Soc., 2:186-190.
21. T. Skolem. (1920). Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen. Skrifter utgit av Videnskabsselskapet i Kristiania, I. Matematisk-naturvidenskabelig klasse, 4, pp. 1-36.
22. V. Sofronie-Stokkermans. (2000). Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I. Studia Logica, 64(1):93-132.
23. V. Sofronie-Stokkermans. (2002). On uniform word problems involving bridging operators on distributive lattices. In U. Egly and Ch. Fermüller, editors, Proceedings of TABLEAUX 2002. LNAI2381, pp. 235-250. Springer.
24. V. Sofronie-Stokkermans. (2003). Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators. Journal of Symbolic Computation, 36(6):891-924.
25. V. Sofronie-Stokkermans. (2005). Hierarchic reasoning in local theory extensions. In R. Nieuwenhuis, editor, 20th International Conference on Automated Deduction (CADE-20), LNAI 3632, pp. 219-234. Springer.
26. V. Sofronie-Stokkermans. (2006). Interpolation in local theory extensions. In U. Furbach and N. Shankar, editors, Proc. 3rd International Joint Conference on Automated Reasoning (IJCAR 2006), LNAI4130, pp. 235-250. Springer.
27. Viorica Sofronie-Stokkermans. (2007). Automated theorem proving by resolution in non-classical logics. Annals of Mathematics and Artificial Intelligence. To appear.
28. E. D. Sontag. (1985). Real addition and the polynomial hierarchy. Information Processing Letters, 20(3): 115-120.
29. H. M. Stone. (1938). The representation of boolean algebras. Bull. Amer. Math. Soc, 44: 807-816.
30. A. Urquhart. (1978). A topological representation theory for lattices. Algebra Universalis, 8:45-58.