Reasoning in Complex Theories and Applications. Advanced Lecture, ESSLLI 2009

ion/ Refinement Model Checking System Specifications

[1]  Michaël Rusinowitch,et al.  A rewriting approach to satisfiability procedures , 2003, Inf. Comput..

[2]  Silvio Ghilardi,et al.  Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems , 2007, CADE.

[3]  Maria Paola Bonacina,et al.  Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures , 2006, IJCAR.

[4]  Jeffrey D. Ullman,et al.  Bottom-up beats top-down for datalog , 1989, PODS '89.

[5]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[6]  Henny B. Sipma,et al.  What's Decidable About Arrays? , 2006, VMCAI.

[7]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

[8]  Jochen Hoenicke,et al.  Combination of processes, data, and time , 2006 .

[9]  Johannes Faber,et al.  Verifying Real-Time Aspects of the European Train Control System ∗ , 2005 .

[10]  Viorica Sofronie-Stokkermans,et al.  Interpolation in Local Theory Extensions , 2006, Log. Methods Comput. Sci..

[11]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

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

[13]  Silvio Ghilardi,et al.  Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics , 2003, LPAR.

[14]  Robert Givan,et al.  Polynomial-time computation via local inference relations , 2000, TOCL.

[15]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[16]  Franz Baader,et al.  A new n-ary existential quantifier in description logics , 2005, Description Logics.

[17]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[18]  Maria Paola Bonacina,et al.  On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal , 2005, FroCoS.

[19]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[20]  Kent A. Spackman,et al.  SNOMED RT: a reference terminology for health care , 1997, AMIA.

[21]  Cesare Tinelli,et al.  Unions of non-disjoint theories and combinations of satisfiability procedures , 2003, Theor. Comput. Sci..

[22]  Robert Givan,et al.  New Results on Local Inference Relations , 1992, KR.

[23]  Silvio Ghilardi,et al.  Model-Theoretic Methods in Combined Constraint Satisfiability , 2004, Journal of Automated Reasoning.

[24]  Viorica Sofronie-Stokkermans,et al.  Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions , 2007, FroCoS.

[25]  Viorica Sofronie-Stokkermans,et al.  Constraint solving for interpolation , 2007, J. Symb. Comput..

[26]  Jochen Hoenicke,et al.  CSP-OZ-DC: A Combination of Specification Techniques for Processes, Data and Time , 2002, Nord. J. Comput..

[27]  Domenico Cantone,et al.  Decision algorithms for fragments of real analysis. I. Continuous functions with strict convexity and concavity predicates , 2006, J. Symb. Comput..

[28]  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.

[29]  Calogero G. Zarba,et al.  Combining Nonstably Infinite Theories , 2005, Journal of Automated Reasoning.

[30]  Carsten Ihlemann,et al.  Local Theory Extensions, Hierarchical Reasoning and Applications to Verification , 2007, Deduction and Decision Procedures.

[31]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[32]  George C. Necula,et al.  Data Structure Specifications via Local Equality Axioms , 2005, CAV.

[33]  Franz Baader,et al.  Restricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles , 2003, Description Logics.

[34]  Kenneth L. McMillan,et al.  An interpolating theorem prover , 2005, Theor. Comput. Sci..

[35]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[36]  Carsten Ihlemann,et al.  Automated Reasoning in Some Local Extensions of Ordered Structures , 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).

[37]  Viorica Sofronie-Stokkermans.  Efficient Hierarchical Reasoning about Functions over Numerical Domains , 2008, KI.

[38]  Harald Ganzinger,et al.  Modular proof systems for partial functions with Evans equality , 2006, Inf. Comput..

[39]  P. Burmeister.  A Model Theoretic Oriented Approach to Partial Algebras , 1986 .

[40]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[41]  Viorica Sofronie-Stokkermans,et al.  Applications of Hierarchical Reasoning in the Verification of Complex Systems , 2007, Electron. Notes Theor. Comput. Sci..

[42]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[43]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

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

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

[46]  William Craig,et al.  Linear reasoning. A new form of the Herbrand-Gentzen theorem , 1957, Journal of Symbolic Logic.

[47]  Kent A. Spackman,et al.  Normal forms for description logic expressions of clinical concepts in SNOMED RT , 2001, AMIA.

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

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

[50]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[51]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[52]  David A. McAllester.  Automatic recognition of tractability in inference relations , 1993, JACM.

[53]  Ákos Seress,et al.  Decidability in elementary analysis, II , 1990 .

[54]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[55]  Cesare Tinelli,et al.  Deciding the Word Problem in the Union of Equational Theories Sharing Constructors , 1999, RTA.

[56]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[57]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[58]  Harald Ganzinger,et al.  Automated complexity analysis based on ordered resolution , 2001, JACM.

[59]  Harald Ganzinger,et al.  Complexity analysis based on ordered resolution , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[60]  Graeme Smith,et al.  The Object-Z Specification Language , 1999, Advances in Formal Methods.

[61]  Johannes Faber,et al.  Verifying CSP-OZ-DC Specifications with Complex Data Types and Timing Parameters , 2007, IFM.

[62]  Michael J. Maher,et al.  On Fourier's algorithm for linear arithmetic constraints , 1992, Journal of Automated Reasoning.

[63]  Viorica Sofronie-Stokkermans.  Locality and Subsumption Testing in EL and Some of its Extensions , 2008, Description Logics.

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

[65]  Carsten Ihlemann,et al.  On Local Reasoning in Verification , 2008, TACAS.

[66]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .