Automated Reasoning in Some Local Extensions of Ordered Structures

We give a uniform method for automated reasoning in several types of extensions of ordered algebraic structures (definitional extensions, extensions with boundedness axioms or with monotonicity axioms). We show that such extensions are local and, hence, efficient methods for hierarchical reasoning exist in all these cases.

[1]  Jonathan David Farley,et al.  Priestley duality for order-preserving maps into distributive lattices , 1996 .

[2]  Hilary A. Priestley,et al.  Representation of Distributive Lattices by means of ordered Stone Spaces , 1970 .

[3]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[4]  Harald Ganzinger.  Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[5]  Stanley Burris,et al.  Polynomial Time Uniform Word Problems , 1995, Math. Log. Q..

[6]  Cesare Tinelli,et al.  DPLL( T): Fast Decision Procedures , 2004, CAV.

[7]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[8]  M. Stone,et al.  The representation of Boolean algebras , 1938 .

[9]  Franco Montagna,et al.  On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic , 2002, Stud Logica.

[10]  Daniele Mundici,et al.  Satisfiability in Many-Valued Sentential Logic is NP-Complete , 1987, Theor. Comput. Sci..

[11]  Viorica Sofronie-Stokkermans,et al.  Duality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics I , 2000, Stud Logica.

[12]  Reiner Hähnle,et al.  Complexity of Many-Valued Logics. , 2001 .

[13]  J. C. C. McKinsey,et al.  The decision problem for some classes of sentences without quantifiers , 1943, Journal of Symbolic Logic.

[14]  Viorica Sofronie-Stokkermans,et al.  Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators , 2003, J. Symb. Comput..

[15]  Chrysafis Hartonas,et al.  Stone duality for lattices , 1997 .

[16]  Viorica Sofronie-Stokkermans.  Interpolation in Local Theory Extensions , 2006, IJCAR.

[17]  Reiner Hähnle.  Proof theory of many-valued logic—linear optimization—logic design: connections and interactions , 1997, Soft Comput..

[18]  Viorica Sofronie-Stokkermans,et al.  Hierarchic Reasoning in Local Theory Extensions , 2005, CADE.

[19]  Trevor Evans,et al.  The Word Problem for Abstract Algebras , 1951 .

[20]  Viorica Sofronie-Stokkermans,et al.  Automated theorem proving by resolution in non-classical logics , 2007, Annals of Mathematics and Artificial Intelligence.

[21]  Viorica Sofronie-Stokkermans.  On Uniform Word Problems Involving Bridging Operators on Distributive Lattices , 2002, TABLEAUX.

[22]  Robert Goldblatt,et al.  Varieties of Complex Algebras , 1989, Ann. Pure Appl. Log..

[23]  Alasdair Urquhart,et al.  A topological representation theory for lattices , 1978 .

[24]  Daniele Mundici,et al.  MV-algebras: a variety for magnitudes with archimedean units , 2005 .

[25]  C. Chang,et al.  Algebraic analysis of many valued logics , 1958 .

[26]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[27]  Eduardo D. Sontag,et al.  Real Addition and the Polynomial Hierarchy , 1985, Inf. Process. Lett..

[28]  Reiner Hähnle,et al.  Many-valued logic and mixed integer programming , 1994, Annals of Mathematics and Artificial Intelligence.

[29]  Franco Montagna,et al.  Complexity and Definability Issues in L Pi 1/2 , 2007, J. Log. Comput..