GRAL 2.0: A Reference Manual
暂无分享,去创建一个
[1] A. Winter. Generic Support for Understanding Heterogeneous Software Generic Support for Understanding Heterogeneous Software , 1995 .
[2] Jürgen Ebert,et al. Meta-CASE in Practice: a Case for KOGGE , 1997, CAiSE.
[3] Frieder Stolzenburg,et al. Membership-Constraints and Complexity in Logic Programming with Sets , 1996, FroCoS.
[4] J. Ebert,et al. Querying Graph Structures with GQL , 1996 .
[5] Chandrabose Aravindan. DisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover , 1996, KI.
[6] Jürgen Ebert,et al. A Declarative Approach to Graph Based Modeling , 1994, WG.
[7] Frieder Stolzenburg,et al. A Flexible System for Constraint Disjunctive Logic Programming , 1998, Künstliche Intell..
[8] Martin Volk,et al. Constraint Logic Programming for Computational Linguistics , 1996, LACL.
[9] Peter Baumgartner,et al. A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion , 1997, Journal of Automated Reasoning.
[10] Michael Maher. Efficient Implementation of the Well-founded and Stable Model Semantics , 1996 .
[11] Jürgen Dix,et al. Logisches Programmieren mit Negation und Disjunktion , 1996, Künstliche Intell..
[12] U. Furbach. Re nements for Restart Model Elimination , 1996 .
[13] Thomas Marx,et al. NetCASE -- a Petri Net based Method for Database Application Design and Generation , 1995 .
[14] Gottfried Vossen,et al. I-Serializability: Generalized Correctness for Transaction-Based Environments , 1997, Inf. Process. Lett..
[15] Stephan Philippi,et al. Integration of Integrity Constraints into Object-Oriented Database Schema according to ODMG-93 , 1995 .
[16] Harro Wimmel. Fachberichte Informatik on Some Compositional Petri Net Semantics Universitt at Koblenz{landau on Some Compositional Petri Net Semantics , 1995 .
[17] Bernhard Thalheim. 15th international conference on conceptual modeling ER '96 , 1998 .
[18] F. Stolzenburg,et al. Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints , 1998 .
[19] Jürgen Dix,et al. A Comparison of STATIC Semantics with D-WFS , 1996 .
[20] John Wordsworth. Software development with Z - a practical approach to formal methods in software engineering , 1992, International computer science series.
[21] Jürgen Dix,et al. Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations , 1996, Fundam. Informaticae.
[22] Jürgen Ebert,et al. Graph Based Modeling and Implementation with EER / GRAL , 1996, ER.
[23] Lutz Priese,et al. Abstract Fairness and Semantics , 1997, Theor. Comput. Sci..
[24] Peter Baumgartner,et al. Calculi for Disjunctive Logic Programming , 1997, ILPS.
[25] Christoph Steigner,et al. Modelling Timeouts in Protocol Design , 1995 .
[26] Jürgen Ebert,et al. Efficient Interpretation of State Charts , 1993, FCT.
[27] Ilkka Niemelä. Implementing Circumscription Using a Tableau Method , 1996, ECAI.
[28] Stefan Brass,et al. D-wfs: a Connuent Calculus and an Equivalent Characterization , 1995 .
[29] Lutz Priese,et al. Algebraic Characterization of Petri Net Pomset Semantics , 1997, CONCUR.
[30] Peter Baumgartner,et al. Model Elimination, Logic Programming and Computing Answers , 1995, IJCAI.
[31] J. Michael Spivey,et al. The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.
[32] Chandrabose Aravindan. An Abductive Framework for Negation in Disjunctive Logic Programming , 1996, JELIA.
[33] Wenjin Lu. Minimal Model Generation Based on E-hyper Tableaux , 1997, KI.
[34] Jürgen Dix,et al. Knowledge Representation with Logic Programs , 1997, LPKR.
[35] Jürgen Dix,et al. Characterizations and Implementation of Static Semantics of Disjunctive Programs , 1996 .
[36] Jürgen Dix,et al. Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications , 1996 .
[37] Ilkka Niemell. A Tableau Calculus for Minimal Model Reasoning Ilkka Niemel a a Tableau Calculus for Minimal Model Reasoning , 1996 .